./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8dd1b8487488da5512ee2059c0a8d89f6280a35cd4bb18d2bead4f575259869d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:26:22,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:26:22,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:26:22,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:26:22,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:26:22,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:26:22,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:26:22,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:26:22,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:26:22,190 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:26:22,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:26:22,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:26:22,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:26:22,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:26:22,192 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:26:22,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:26:22,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:26:22,193 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:26:22,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:26:22,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:26:22,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:26:22,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:26:22,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:26:22,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:26:22,200 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:26:22,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:26:22,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:26:22,201 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:26:22,201 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:26:22,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:26:22,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:26:22,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:26:22,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:26:22,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:26:22,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:26:22,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:26:22,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:26:22,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:26:22,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:26:22,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:26:22,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:26:22,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:26:22,206 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8dd1b8487488da5512ee2059c0a8d89f6280a35cd4bb18d2bead4f575259869d [2024-10-24 07:26:22,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:26:22,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:26:22,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:26:22,548 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:26:22,549 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:26:22,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2024-10-24 07:26:24,117 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:26:24,338 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:26:24,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2024-10-24 07:26:24,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/284029d8d/ad1308c6049a44fbb2d1df9876c68916/FLAGc2c60d4e0 [2024-10-24 07:26:24,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/284029d8d/ad1308c6049a44fbb2d1df9876c68916 [2024-10-24 07:26:24,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:26:24,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:26:24,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:26:24,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:26:24,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:26:24,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:26:24" (1/1) ... [2024-10-24 07:26:24,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e95581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:24, skipping insertion in model container [2024-10-24 07:26:24,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:26:24" (1/1) ... [2024-10-24 07:26:24,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:26:24,594 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i[919,932] [2024-10-24 07:26:24,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:26:24,682 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:26:24,692 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i[919,932] [2024-10-24 07:26:24,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:26:24,751 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:26:24,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:24 WrapperNode [2024-10-24 07:26:24,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:26:24,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:26:24,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:26:24,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:26:24,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:24" (1/1) ... [2024-10-24 07:26:24,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:24" (1/1) ... [2024-10-24 07:26:24,812 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-10-24 07:26:24,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:26:24,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:26:24,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:26:24,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:26:24,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:24" (1/1) ... [2024-10-24 07:26:24,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:24" (1/1) ... [2024-10-24 07:26:24,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:24" (1/1) ... [2024-10-24 07:26:24,863 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 07:26:24,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:24" (1/1) ... [2024-10-24 07:26:24,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:24" (1/1) ... [2024-10-24 07:26:24,872 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:24" (1/1) ... [2024-10-24 07:26:24,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:24" (1/1) ... [2024-10-24 07:26:24,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:24" (1/1) ... [2024-10-24 07:26:24,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:24" (1/1) ... [2024-10-24 07:26:24,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:26:24,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:26:24,894 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:26:24,894 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:26:24,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:24" (1/1) ... [2024-10-24 07:26:24,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:26:24,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:26:24,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 07:26:24,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 07:26:24,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:26:24,993 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:26:24,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:26:24,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:26:24,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:26:24,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:26:25,111 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:26:25,118 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:26:25,545 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 07:26:25,546 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:26:25,606 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:26:25,606 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:26:25,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:26:25 BoogieIcfgContainer [2024-10-24 07:26:25,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:26:25,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:26:25,611 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:26:25,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:26:25,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:26:24" (1/3) ... [2024-10-24 07:26:25,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540b8a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:26:25, skipping insertion in model container [2024-10-24 07:26:25,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:24" (2/3) ... [2024-10-24 07:26:25,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540b8a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:26:25, skipping insertion in model container [2024-10-24 07:26:25,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:26:25" (3/3) ... [2024-10-24 07:26:25,619 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2024-10-24 07:26:25,635 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:26:25,635 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:26:25,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:26:25,722 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7e2c9421, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:26:25,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:26:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 07:26:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-24 07:26:25,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:25,748 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:26:25,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:25,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1496674144, now seen corresponding path program 1 times [2024-10-24 07:26:25,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:26:25,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073811463] [2024-10-24 07:26:25,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:25,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:26:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:26:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:26:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:26:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:26:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:26:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:26:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:26:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:26:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:26:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:26:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:26:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:26:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:26:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:26:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:26:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:26:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:26:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:26:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:26:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:26:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:26:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 07:26:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 07:26:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 07:26:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:26:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:26:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 07:26:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 07:26:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 07:26:26,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:26:26,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073811463] [2024-10-24 07:26:26,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073811463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:26:26,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:26:26,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:26:26,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260633461] [2024-10-24 07:26:26,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:26,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:26:26,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:26:26,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:26:26,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:26:26,553 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:26:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:26,675 INFO L93 Difference]: Finished difference Result 182 states and 332 transitions. [2024-10-24 07:26:26,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:26:26,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2024-10-24 07:26:26,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:26,692 INFO L225 Difference]: With dead ends: 182 [2024-10-24 07:26:26,693 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 07:26:26,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:26:26,705 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 29 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:26,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 235 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:26:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 07:26:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-10-24 07:26:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 66 states have internal predecessors, (94), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:26:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 154 transitions. [2024-10-24 07:26:26,773 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 154 transitions. Word has length 173 [2024-10-24 07:26:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:26,775 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 154 transitions. [2024-10-24 07:26:26,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:26:26,776 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 154 transitions. [2024-10-24 07:26:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-24 07:26:26,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:26,781 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:26:26,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:26:26,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:26,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:26,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1384612114, now seen corresponding path program 1 times [2024-10-24 07:26:26,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:26:26,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013879443] [2024-10-24 07:26:26,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:26,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:26:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:26:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:26:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:26:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:26:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:26:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:26:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:26:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:26:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:26:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:26:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:26:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:26:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:26:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:26:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:26:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:26:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:26:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:26:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:26:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:26:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:26:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 07:26:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 07:26:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 07:26:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:26:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:26:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 07:26:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 07:26:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 07:26:27,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:26:27,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013879443] [2024-10-24 07:26:27,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013879443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:26:27,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:26:27,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:26:27,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256212627] [2024-10-24 07:26:27,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:27,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:26:27,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:26:27,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:26:27,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:26:27,194 INFO L87 Difference]: Start difference. First operand 98 states and 154 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 07:26:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:27,273 INFO L93 Difference]: Finished difference Result 195 states and 307 transitions. [2024-10-24 07:26:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:26:27,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 174 [2024-10-24 07:26:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:27,281 INFO L225 Difference]: With dead ends: 195 [2024-10-24 07:26:27,281 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 07:26:27,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:26:27,286 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 98 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:27,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 114 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:26:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 07:26:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-24 07:26:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 66 states have internal predecessors, (93), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:26:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 153 transitions. [2024-10-24 07:26:27,341 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 153 transitions. Word has length 174 [2024-10-24 07:26:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:27,342 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 153 transitions. [2024-10-24 07:26:27,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 07:26:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 153 transitions. [2024-10-24 07:26:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-24 07:26:27,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:27,350 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:26:27,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:26:27,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:27,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2101008556, now seen corresponding path program 1 times [2024-10-24 07:26:27,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:26:27,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279102790] [2024-10-24 07:26:27,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:27,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:26:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:26:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:26:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:26:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:26:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:26:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:26:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:26:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:26:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:26:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:26:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:26:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:26:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:26:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:26:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:26:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:26:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:26:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:26:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:26:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:26:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 07:26:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 07:26:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 07:26:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 07:26:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 07:26:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 07:26:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 07:26:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 07:26:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-24 07:26:27,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:26:27,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279102790] [2024-10-24 07:26:27,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279102790] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:26:27,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541330754] [2024-10-24 07:26:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:27,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:26:27,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:26:27,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:26:27,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 07:26:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:28,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 07:26:28,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:26:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 929 proven. 12 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2024-10-24 07:26:28,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:26:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-24 07:26:28,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541330754] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:26:28,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:26:28,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-24 07:26:28,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391806821] [2024-10-24 07:26:28,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:26:28,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 07:26:28,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:26:28,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 07:26:28,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 07:26:28,812 INFO L87 Difference]: Start difference. First operand 98 states and 153 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 6 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 6 states have call successors, (68) [2024-10-24 07:26:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:29,175 INFO L93 Difference]: Finished difference Result 203 states and 312 transitions. [2024-10-24 07:26:29,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 07:26:29,178 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 6 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 6 states have call successors, (68) Word has length 174 [2024-10-24 07:26:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:29,180 INFO L225 Difference]: With dead ends: 203 [2024-10-24 07:26:29,180 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 07:26:29,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2024-10-24 07:26:29,184 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 324 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:29,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 201 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 07:26:29,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 07:26:29,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2024-10-24 07:26:29,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:26:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2024-10-24 07:26:29,201 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 174 [2024-10-24 07:26:29,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:29,202 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2024-10-24 07:26:29,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 6 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 6 states have call successors, (68) [2024-10-24 07:26:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2024-10-24 07:26:29,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 07:26:29,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:29,206 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:26:29,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 07:26:29,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:26:29,407 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:29,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:29,408 INFO L85 PathProgramCache]: Analyzing trace with hash 311817159, now seen corresponding path program 1 times [2024-10-24 07:26:29,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:26:29,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062381898] [2024-10-24 07:26:29,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:29,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:26:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 07:26:29,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955496571] [2024-10-24 07:26:29,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:29,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:26:29,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:26:29,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:26:29,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 07:26:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:26:29,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 07:26:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:26:29,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 07:26:29,908 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 07:26:29,909 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 07:26:29,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 07:26:30,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-24 07:26:30,116 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 07:26:30,259 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 07:26:30,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:26:30 BoogieIcfgContainer [2024-10-24 07:26:30,264 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 07:26:30,265 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 07:26:30,265 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 07:26:30,265 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 07:26:30,266 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:26:25" (3/4) ... [2024-10-24 07:26:30,269 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 07:26:30,271 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 07:26:30,271 INFO L158 Benchmark]: Toolchain (without parser) took 5901.13ms. Allocated memory was 180.4MB in the beginning and 239.1MB in the end (delta: 58.7MB). Free memory was 141.8MB in the beginning and 139.0MB in the end (delta: 2.9MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2024-10-24 07:26:30,272 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:26:30,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.92ms. Allocated memory is still 180.4MB. Free memory was 141.8MB in the beginning and 125.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 07:26:30,272 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.66ms. Allocated memory is still 180.4MB. Free memory was 125.0MB in the beginning and 122.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 07:26:30,272 INFO L158 Benchmark]: Boogie Preprocessor took 79.03ms. Allocated memory is still 180.4MB. Free memory was 122.4MB in the beginning and 118.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 07:26:30,273 INFO L158 Benchmark]: RCFGBuilder took 712.93ms. Allocated memory is still 180.4MB. Free memory was 118.8MB in the beginning and 89.4MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-24 07:26:30,273 INFO L158 Benchmark]: TraceAbstraction took 4653.61ms. Allocated memory was 180.4MB in the beginning and 239.1MB in the end (delta: 58.7MB). Free memory was 88.8MB in the beginning and 139.0MB in the end (delta: -50.1MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-10-24 07:26:30,273 INFO L158 Benchmark]: Witness Printer took 5.77ms. Allocated memory is still 239.1MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:26:30,275 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.92ms. Allocated memory is still 180.4MB. Free memory was 141.8MB in the beginning and 125.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.66ms. Allocated memory is still 180.4MB. Free memory was 125.0MB in the beginning and 122.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.03ms. Allocated memory is still 180.4MB. Free memory was 122.4MB in the beginning and 118.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 712.93ms. Allocated memory is still 180.4MB. Free memory was 118.8MB in the beginning and 89.4MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4653.61ms. Allocated memory was 180.4MB in the beginning and 239.1MB in the end (delta: 58.7MB). Free memory was 88.8MB in the beginning and 139.0MB in the end (delta: -50.1MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Witness Printer took 5.77ms. Allocated memory is still 239.1MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryArithmeticFLOAToperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 0; [L26] signed short int var_1_9 = 0; [L27] signed short int var_1_10 = 8; [L28] signed char var_1_11 = 1; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = -2; [L31] signed char var_1_14 = 8; [L32] signed char var_1_15 = 0; [L33] signed char var_1_16 = 10; [L34] signed char var_1_17 = 32; [L35] unsigned char var_1_18 = 0; [L36] signed char var_1_19 = -1; [L37] signed short int var_1_20 = 100; [L38] signed short int var_1_22 = 29265; [L39] float var_1_23 = 31.6; [L40] float var_1_24 = 9.2; [L41] float var_1_25 = 15.6; [L42] float var_1_26 = 25.25; [L43] unsigned long int var_1_27 = 256; [L44] double var_1_29 = 15.86; [L45] signed short int var_1_31 = 10; [L46] float var_1_39 = 4.7; [L47] unsigned short int var_1_40 = 100; [L48] signed short int var_1_41 = 4; [L49] float var_1_45 = 31.6; [L50] unsigned short int var_1_47 = 64; [L51] double var_1_48 = 16.75; [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] FCALL updateLastVariables() [L193] CALL updateVariables() [L138] var_1_6 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_7=0, var_1_8=0, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L141] var_1_7 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L142] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L144] var_1_9 = __VERIFIER_nondet_short() [L145] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L145] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L146] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L146] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L147] var_1_10 = __VERIFIER_nondet_short() [L148] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L148] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L149] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L149] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L150] var_1_12 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L151] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L152] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L152] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L153] var_1_13 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L154] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L155] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L155] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L156] var_1_14 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L157] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L158] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L158] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L159] var_1_15 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L160] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L161] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L161] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L162] var_1_16 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L163] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L164] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L164] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L165] var_1_17 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L166] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L167] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L167] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L168] var_1_19 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L169] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L170] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L170] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L171] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L171] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L172] var_1_22 = __VERIFIER_nondet_short() [L173] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L173] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L174] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L174] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L175] var_1_24 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L176] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L177] var_1_25 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L178] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L179] var_1_26 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L180] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L193] RET updateVariables() [L194] CALL step() [L55] var_1_8 = (var_1_9 - (2 + var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L56] COND TRUE var_1_22 != var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L57] COND TRUE var_1_10 <= var_1_17 [L58] var_1_23 = (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=47/10, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L63] COND FALSE !(var_1_25 < var_1_25) [L68] var_1_39 = 15.6f VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=64, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L70] var_1_47 = var_1_17 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L71] COND TRUE ! ((var_1_9 - var_1_22) > var_1_12) [L72] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L74] COND FALSE !(var_1_23 == var_1_23) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L79] COND TRUE (- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23) [L80] var_1_20 = ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16380, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=100, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L84] var_1_40 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16380, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L85] COND TRUE \read(var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16380, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L86] COND TRUE \read(var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16380, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L87] COND FALSE !(10000000 <= var_1_16) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16380, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_45=158/5, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L102] COND TRUE var_1_7 || var_1_6 [L103] var_1_45 = (10.125f + var_1_24) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16380, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L105] COND FALSE !(\read(var_1_18)) [L108] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=-255, var_1_20=16380, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=10, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L110] COND TRUE var_1_1 && var_1_7 [L111] var_1_31 = ((((((((var_1_17 - var_1_15)) > (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) ? ((var_1_17 - var_1_15)) : (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) < 0 ) ? -(((((var_1_17 - var_1_15)) > (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) ? ((var_1_17 - var_1_15)) : (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) : (((((var_1_17 - var_1_15)) > (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) ? ((var_1_17 - var_1_15)) : (((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=-255, var_1_20=16380, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=2, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L121] COND TRUE \read(var_1_1) [L122] var_1_11 = (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, var_1_10=0, var_1_11=3, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=-255, var_1_20=16380, var_1_22=16382, var_1_27=0, var_1_29=793/50, var_1_31=2, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=0, var_1_48=67/4, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L134] var_1_29 = var_1_24 [L135] var_1_48 = var_1_25 [L194] RET step() [L195] CALL, EXPR property() [L185-L186] return ((((((var_1_18 ? (var_1_1 == ((unsigned char) (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_8 == ((signed short int) (var_1_9 - (2 + var_1_10))))) && (var_1_1 ? (var_1_11 == ((signed char) (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) : ((var_1_27 >= var_1_14) ? (var_1_11 == ((signed char) ((var_1_15 + var_1_16) - var_1_17))) : (var_1_7 ? (var_1_11 == ((signed char) var_1_16)) : (var_1_11 == ((signed char) var_1_12)))))) && ((var_1_23 == var_1_23) ? ((var_1_15 >= (var_1_27 / var_1_19)) ? (var_1_18 == ((unsigned char) var_1_7)) : 1) : 1)) && (((- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23)) ? (var_1_20 == ((signed short int) ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10))) : (var_1_20 == ((signed short int) var_1_19)))) && ((var_1_22 != var_1_12) ? ((var_1_10 <= var_1_17) ? (var_1_23 == ((float) (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))) : 1) : (var_1_23 == ((float) var_1_25)))) && ((! ((var_1_9 - var_1_22) > var_1_12)) ? (var_1_27 == ((unsigned long int) var_1_15)) : 1) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=3, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=-255, var_1_20=16380, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_27=0, var_1_29=2, var_1_31=2, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=3, var_1_12=1, var_1_13=2, var_1_14=2, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=-255, var_1_20=16380, var_1_22=16382, var_1_24=2, var_1_25=3, var_1_27=0, var_1_29=2, var_1_31=2, var_1_39=78/5, var_1_40=0, var_1_41=4, var_1_47=0, var_1_48=3, var_1_6=0, var_1_7=-255, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 4, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 474 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 550 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 223 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 327 mSDtfsCounter, 222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 528 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=3, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1045 NumberOfCodeBlocks, 1045 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 864 ConstructedInterpolants, 0 QuantifiedInterpolants, 1452 SizeOfPredicates, 3 NumberOfNonLiveVariables, 406 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 7524/7560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 07:26:30,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8dd1b8487488da5512ee2059c0a8d89f6280a35cd4bb18d2bead4f575259869d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:26:32,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:26:32,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 07:26:32,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:26:32,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:26:32,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:26:32,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:26:32,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:26:32,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:26:32,862 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:26:32,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:26:32,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:26:32,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:26:32,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:26:32,867 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:26:32,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:26:32,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:26:32,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:26:32,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:26:32,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:26:32,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:26:32,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:26:32,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:26:32,874 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 07:26:32,874 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 07:26:32,875 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:26:32,875 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 07:26:32,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:26:32,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:26:32,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:26:32,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:26:32,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:26:32,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:26:32,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:26:32,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:26:32,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:26:32,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:26:32,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:26:32,881 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 07:26:32,881 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 07:26:32,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:26:32,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:26:32,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:26:32,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:26:32,882 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 07:26:32,882 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8dd1b8487488da5512ee2059c0a8d89f6280a35cd4bb18d2bead4f575259869d [2024-10-24 07:26:33,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:26:33,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:26:33,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:26:33,285 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:26:33,286 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:26:33,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2024-10-24 07:26:34,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:26:35,210 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:26:35,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2024-10-24 07:26:35,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ff13e71/9999c9d0dd5046c49a9e217001ce7b23/FLAGabf647f4d [2024-10-24 07:26:35,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ff13e71/9999c9d0dd5046c49a9e217001ce7b23 [2024-10-24 07:26:35,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:26:35,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:26:35,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:26:35,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:26:35,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:26:35,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:26:35" (1/1) ... [2024-10-24 07:26:35,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c84978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:35, skipping insertion in model container [2024-10-24 07:26:35,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:26:35" (1/1) ... [2024-10-24 07:26:35,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:26:35,469 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i[919,932] [2024-10-24 07:26:35,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:26:35,567 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:26:35,580 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i[919,932] [2024-10-24 07:26:35,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:26:35,662 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:26:35,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:35 WrapperNode [2024-10-24 07:26:35,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:26:35,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:26:35,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:26:35,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:26:35,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:35" (1/1) ... [2024-10-24 07:26:35,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:35" (1/1) ... [2024-10-24 07:26:35,731 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-10-24 07:26:35,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:26:35,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:26:35,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:26:35,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:26:35,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:35" (1/1) ... [2024-10-24 07:26:35,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:35" (1/1) ... [2024-10-24 07:26:35,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:35" (1/1) ... [2024-10-24 07:26:35,776 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 07:26:35,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:35" (1/1) ... [2024-10-24 07:26:35,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:35" (1/1) ... [2024-10-24 07:26:35,792 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:35" (1/1) ... [2024-10-24 07:26:35,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:35" (1/1) ... [2024-10-24 07:26:35,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:35" (1/1) ... [2024-10-24 07:26:35,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:35" (1/1) ... [2024-10-24 07:26:35,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:26:35,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:26:35,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:26:35,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:26:35,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:35" (1/1) ... [2024-10-24 07:26:35,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:26:35,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:26:35,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 07:26:35,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 07:26:35,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:26:35,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 07:26:35,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:26:35,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:26:35,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:26:35,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:26:35,991 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:26:36,001 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:26:38,443 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 07:26:38,443 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:26:38,519 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:26:38,519 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:26:38,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:26:38 BoogieIcfgContainer [2024-10-24 07:26:38,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:26:38,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:26:38,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:26:38,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:26:38,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:26:35" (1/3) ... [2024-10-24 07:26:38,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2daaf405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:26:38, skipping insertion in model container [2024-10-24 07:26:38,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:35" (2/3) ... [2024-10-24 07:26:38,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2daaf405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:26:38, skipping insertion in model container [2024-10-24 07:26:38,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:26:38" (3/3) ... [2024-10-24 07:26:38,546 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-29.i [2024-10-24 07:26:38,564 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:26:38,565 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:26:38,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:26:38,651 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@125a7568, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:26:38,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:26:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 49 states have internal predecessors, (74), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 07:26:38,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-24 07:26:38,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:38,677 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:26:38,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:38,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:38,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1800076, now seen corresponding path program 1 times [2024-10-24 07:26:38,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:26:38,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169168293] [2024-10-24 07:26:38,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:38,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:26:38,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:26:38,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:26:38,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 07:26:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:39,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 07:26:39,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:26:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2024-10-24 07:26:39,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:26:39,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:26:39,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169168293] [2024-10-24 07:26:39,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169168293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:26:39,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:26:39,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:26:39,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803473974] [2024-10-24 07:26:39,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:39,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:26:39,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:26:39,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:26:39,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:26:39,276 INFO L87 Difference]: Start difference. First operand has 79 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 49 states have internal predecessors, (74), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 07:26:41,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:26:41,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:41,166 INFO L93 Difference]: Finished difference Result 154 states and 284 transitions. [2024-10-24 07:26:41,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:26:41,193 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 173 [2024-10-24 07:26:41,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:41,201 INFO L225 Difference]: With dead ends: 154 [2024-10-24 07:26:41,202 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 07:26:41,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:26:41,209 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:41,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 07:26:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 07:26:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-24 07:26:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 07:26:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 121 transitions. [2024-10-24 07:26:41,261 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 121 transitions. Word has length 173 [2024-10-24 07:26:41,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:41,262 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 121 transitions. [2024-10-24 07:26:41,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 07:26:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 121 transitions. [2024-10-24 07:26:41,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-24 07:26:41,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:41,267 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:26:41,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 07:26:41,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:26:41,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:41,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:41,469 INFO L85 PathProgramCache]: Analyzing trace with hash -377957200, now seen corresponding path program 1 times [2024-10-24 07:26:41,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:26:41,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052781108] [2024-10-24 07:26:41,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:41,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:26:41,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:26:41,478 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:26:41,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 07:26:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:41,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 07:26:41,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:26:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-10-24 07:26:42,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:26:42,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:26:42,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052781108] [2024-10-24 07:26:42,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052781108] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:26:42,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [737410697] [2024-10-24 07:26:42,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:42,358 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 07:26:42,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 07:26:42,361 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 07:26:42,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-24 07:26:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:42,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 07:26:42,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:26:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 07:26:42,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:26:42,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [737410697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:26:42,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 07:26:42,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-24 07:26:42,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556067126] [2024-10-24 07:26:42,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:42,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:26:42,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:26:42,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:26:42,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:26:42,938 INFO L87 Difference]: Start difference. First operand 76 states and 121 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:26:45,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:26:47,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:26:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:47,103 INFO L93 Difference]: Finished difference Result 172 states and 271 transitions. [2024-10-24 07:26:47,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:26:47,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2024-10-24 07:26:47,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:47,108 INFO L225 Difference]: With dead ends: 172 [2024-10-24 07:26:47,108 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 07:26:47,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:26:47,113 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 28 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:47,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 217 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-24 07:26:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 07:26:47,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2024-10-24 07:26:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 07:26:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2024-10-24 07:26:47,153 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 173 [2024-10-24 07:26:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:47,160 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2024-10-24 07:26:47,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:26:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2024-10-24 07:26:47,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-24 07:26:47,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:47,166 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:26:47,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-24 07:26:47,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 07:26:47,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:26:47,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:47,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash -716921746, now seen corresponding path program 1 times [2024-10-24 07:26:47,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:26:47,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746031642] [2024-10-24 07:26:47,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:47,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:26:47,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:26:47,579 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:26:47,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 07:26:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:47,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 07:26:47,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:26:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-10-24 07:26:48,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:26:48,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:26:48,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746031642] [2024-10-24 07:26:48,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746031642] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:26:48,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [574156197] [2024-10-24 07:26:48,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:48,390 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 07:26:48,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 07:26:48,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 07:26:48,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-24 07:26:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:48,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 07:26:48,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:26:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 07:26:50,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:26:50,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [574156197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:26:50,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 07:26:50,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-24 07:26:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555711892] [2024-10-24 07:26:50,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:50,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:26:50,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:26:50,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:26:50,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:26:50,394 INFO L87 Difference]: Start difference. First operand 94 states and 147 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:26:53,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:26:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:53,844 INFO L93 Difference]: Finished difference Result 280 states and 439 transitions. [2024-10-24 07:26:53,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:26:53,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 174 [2024-10-24 07:26:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:53,854 INFO L225 Difference]: With dead ends: 280 [2024-10-24 07:26:53,857 INFO L226 Difference]: Without dead ends: 187 [2024-10-24 07:26:53,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:26:53,860 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 32 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:53,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 232 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-24 07:26:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-24 07:26:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2024-10-24 07:26:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 120 states have (on average 1.4166666666666667) internal successors, (170), 122 states have internal predecessors, (170), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 07:26:53,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 290 transitions. [2024-10-24 07:26:53,916 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 290 transitions. Word has length 174 [2024-10-24 07:26:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:53,917 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 290 transitions. [2024-10-24 07:26:53,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:26:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 290 transitions. [2024-10-24 07:26:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-24 07:26:53,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:53,924 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:26:53,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 07:26:54,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-10-24 07:26:54,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 07:26:54,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:54,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:54,326 INFO L85 PathProgramCache]: Analyzing trace with hash -659663444, now seen corresponding path program 1 times [2024-10-24 07:26:54,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:26:54,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695542016] [2024-10-24 07:26:54,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:54,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:26:54,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:26:54,331 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:26:54,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 07:26:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 07:26:54,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:26:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-10-24 07:26:55,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:26:55,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:26:55,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695542016] [2024-10-24 07:26:55,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695542016] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:26:55,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [724397758] [2024-10-24 07:26:55,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:55,195 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 07:26:55,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 07:26:55,198 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 07:26:55,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-24 07:26:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 07:26:56,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:26:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 07:26:56,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:26:56,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [724397758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:26:56,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 07:26:56,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-24 07:26:56,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83563538] [2024-10-24 07:26:56,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:56,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:26:56,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:26:56,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:26:56,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:26:56,433 INFO L87 Difference]: Start difference. First operand 185 states and 290 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:26:59,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:27:01,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:27:01,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:01,305 INFO L93 Difference]: Finished difference Result 551 states and 864 transitions. [2024-10-24 07:27:01,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:27:01,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 174 [2024-10-24 07:27:01,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:01,315 INFO L225 Difference]: With dead ends: 551 [2024-10-24 07:27:01,316 INFO L226 Difference]: Without dead ends: 367 [2024-10-24 07:27:01,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:27:01,319 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 112 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:01,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 307 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-24 07:27:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-24 07:27:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2024-10-24 07:27:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 236 states have (on average 1.38135593220339) internal successors, (326), 240 states have internal predecessors, (326), 120 states have call successors, (120), 8 states have call predecessors, (120), 8 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-24 07:27:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 566 transitions. [2024-10-24 07:27:01,372 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 566 transitions. Word has length 174 [2024-10-24 07:27:01,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:01,373 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 566 transitions. [2024-10-24 07:27:01,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-24 07:27:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 566 transitions. [2024-10-24 07:27:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-24 07:27:01,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:01,380 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:27:01,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 07:27:01,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-10-24 07:27:01,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 07:27:01,782 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:01,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:01,783 INFO L85 PathProgramCache]: Analyzing trace with hash -401498006, now seen corresponding path program 1 times [2024-10-24 07:27:01,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:27:01,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73278617] [2024-10-24 07:27:01,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:01,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:27:01,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:27:01,786 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:27:01,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 07:27:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:02,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 07:27:02,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:27:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-10-24 07:27:02,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:27:02,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:27:02,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73278617] [2024-10-24 07:27:02,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73278617] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:27:02,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [773751768] [2024-10-24 07:27:02,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:02,501 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 07:27:02,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 07:27:02,502 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 07:27:02,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-10-24 07:27:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:03,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 07:27:03,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:27:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 183 proven. 3 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-24 07:27:04,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:27:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-24 07:27:05,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [773751768] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:27:05,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:27:05,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2024-10-24 07:27:05,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280446218] [2024-10-24 07:27:05,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:27:05,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 07:27:05,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:27:05,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 07:27:05,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-24 07:27:05,339 INFO L87 Difference]: Start difference. First operand 365 states and 566 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2024-10-24 07:27:16,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 07:27:19,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 07:27:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:24,152 INFO L93 Difference]: Finished difference Result 995 states and 1493 transitions. [2024-10-24 07:27:24,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-24 07:27:24,154 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 174 [2024-10-24 07:27:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:24,159 INFO L225 Difference]: With dead ends: 995 [2024-10-24 07:27:24,160 INFO L226 Difference]: Without dead ends: 631 [2024-10-24 07:27:24,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 07:27:24,162 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 278 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:24,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 523 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 15.2s Time] [2024-10-24 07:27:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-10-24 07:27:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 405. [2024-10-24 07:27:24,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 268 states have (on average 1.328358208955224) internal successors, (356), 272 states have internal predecessors, (356), 120 states have call successors, (120), 16 states have call predecessors, (120), 16 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-24 07:27:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 596 transitions. [2024-10-24 07:27:24,237 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 596 transitions. Word has length 174 [2024-10-24 07:27:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:24,239 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 596 transitions. [2024-10-24 07:27:24,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2024-10-24 07:27:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 596 transitions. [2024-10-24 07:27:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 07:27:24,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:24,241 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:27:24,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 07:27:24,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2024-10-24 07:27:24,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 07:27:24,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:24,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash 327297555, now seen corresponding path program 1 times [2024-10-24 07:27:24,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:27:24,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338829425] [2024-10-24 07:27:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:24,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:27:24,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:27:24,647 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:27:24,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 07:27:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:25,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 07:27:25,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:27:41,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from false [2024-10-24 07:27:45,298 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true