./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_operatoramount_amount50_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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_operatoramount_amount50_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 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:01:23,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:01:23,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:01:23,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:01:23,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:01:23,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:01:23,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:01:23,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:01:23,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:01:23,603 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:01:23,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:01:23,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:01:23,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:01:23,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:01:23,605 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:01:23,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:01:23,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:01:23,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:01:23,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:01:23,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:01:23,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:01:23,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:01:23,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:01:23,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:01:23,613 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:01:23,613 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:01:23,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:01:23,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:01:23,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:01:23,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:01:23,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:01:23,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:01:23,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:01:23,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:01:23,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:01:23,617 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:01:23,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:01:23,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:01:23,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:01:23,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:01:23,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:01:23,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:01:23,620 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 -> 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 [2024-11-20 08:01:23,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:01:23,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:01:23,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:01:23,882 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:01:23,882 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:01:23,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-11-20 08:01:25,363 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:01:25,567 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:01:25,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-11-20 08:01:25,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313ebb3fa/8c459106b20f412785c1cca4bc31fd2e/FLAG427250165 [2024-11-20 08:01:25,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/313ebb3fa/8c459106b20f412785c1cca4bc31fd2e [2024-11-20 08:01:25,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:01:25,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:01:25,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:01:25,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:01:25,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:01:25,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:01:25" (1/1) ... [2024-11-20 08:01:25,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12eb7ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:25, skipping insertion in model container [2024-11-20 08:01:25,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:01:25" (1/1) ... [2024-11-20 08:01:25,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:01:25,795 WARN L250 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_operatoramount_amount50_file-29.i[915,928] [2024-11-20 08:01:25,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:01:25,887 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:01:25,899 WARN L250 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_operatoramount_amount50_file-29.i[915,928] [2024-11-20 08:01:25,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:01:25,959 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:01:25,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:25 WrapperNode [2024-11-20 08:01:25,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:01:25,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:01:25,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:01:25,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:01:25,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:25" (1/1) ... [2024-11-20 08:01:25,974 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:25" (1/1) ... [2024-11-20 08:01:26,002 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2024-11-20 08:01:26,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:01:26,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:01:26,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:01:26,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:01:26,019 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:25" (1/1) ... [2024-11-20 08:01:26,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:25" (1/1) ... [2024-11-20 08:01:26,022 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:25" (1/1) ... [2024-11-20 08:01:26,039 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-11-20 08:01:26,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:25" (1/1) ... [2024-11-20 08:01:26,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:25" (1/1) ... [2024-11-20 08:01:26,047 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:25" (1/1) ... [2024-11-20 08:01:26,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:25" (1/1) ... [2024-11-20 08:01:26,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:25" (1/1) ... [2024-11-20 08:01:26,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:25" (1/1) ... [2024-11-20 08:01:26,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:01:26,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:01:26,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:01:26,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:01:26,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:25" (1/1) ... [2024-11-20 08:01:26,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:01:26,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:01:26,109 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-11-20 08:01:26,130 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-11-20 08:01:26,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:01:26,185 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:01:26,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:01:26,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:01:26,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:01:26,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:01:26,273 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:01:26,276 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:01:26,645 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 08:01:26,645 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:01:26,665 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:01:26,666 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:01:26,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:01:26 BoogieIcfgContainer [2024-11-20 08:01:26,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:01:26,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:01:26,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:01:26,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:01:26,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:01:25" (1/3) ... [2024-11-20 08:01:26,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f8cdd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:01:26, skipping insertion in model container [2024-11-20 08:01:26,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:25" (2/3) ... [2024-11-20 08:01:26,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f8cdd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:01:26, skipping insertion in model container [2024-11-20 08:01:26,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:01:26" (3/3) ... [2024-11-20 08:01:26,678 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-29.i [2024-11-20 08:01:26,694 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:01:26,695 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:01:26,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:01:26,782 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;@76846572, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:01:26,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:01:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 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-11-20 08:01:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 08:01:26,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:01:26,808 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] [2024-11-20 08:01:26,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:01:26,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:01:26,815 INFO L85 PathProgramCache]: Analyzing trace with hash 731389584, now seen corresponding path program 1 times [2024-11-20 08:01:26,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:01:26,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479177680] [2024-11-20 08:01:26,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:01:26,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:01:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:01:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:01:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:01:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:01:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:01:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:01:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:01:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:01:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:01:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:01:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:01:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:01:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:01:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:01:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:01:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 08:01:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:01:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:01:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:01:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 08:01:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 08:01:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 08:01:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:01:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:01:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 08:01:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 08:01:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 08:01:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 08:01:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 08:01:27,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:01:27,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479177680] [2024-11-20 08:01:27,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479177680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:01:27,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:01:27,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:01:27,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904207347] [2024-11-20 08:01:27,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:01:27,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:01:27,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:01:27,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:01:27,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:01:27,947 INFO L87 Difference]: Start difference. First operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 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 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-11-20 08:01:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:01:28,034 INFO L93 Difference]: Finished difference Result 202 states and 380 transitions. [2024-11-20 08:01:28,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:01:28,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 170 [2024-11-20 08:01:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:01:28,046 INFO L225 Difference]: With dead ends: 202 [2024-11-20 08:01:28,046 INFO L226 Difference]: Without dead ends: 133 [2024-11-20 08:01:28,050 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-11-20 08:01:28,055 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 51 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:01:28,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 201 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:01:28,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-20 08:01:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-20 08:01:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 08:01:28,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 205 transitions. [2024-11-20 08:01:28,137 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 205 transitions. Word has length 170 [2024-11-20 08:01:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:01:28,138 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 205 transitions. [2024-11-20 08:01:28,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-11-20 08:01:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 205 transitions. [2024-11-20 08:01:28,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 08:01:28,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:01:28,142 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] [2024-11-20 08:01:28,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:01:28,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:01:28,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:01:28,143 INFO L85 PathProgramCache]: Analyzing trace with hash 788647886, now seen corresponding path program 1 times [2024-11-20 08:01:28,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:01:28,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492510469] [2024-11-20 08:01:28,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:01:28,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:01:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:01:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:01:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:01:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:01:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:01:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:01:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:01:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:01:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:01:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:01:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:01:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:01:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:01:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:01:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:01:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 08:01:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:01:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:01:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 08:01:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 08:01:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 08:01:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 08:01:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 08:01:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 08:01:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 08:01:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 08:01:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 08:01:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 08:01:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 08:01:28,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:01:28,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492510469] [2024-11-20 08:01:28,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492510469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:01:28,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472611513] [2024-11-20 08:01:28,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:01:28,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:01:28,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:01:28,698 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-11-20 08:01:28,699 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-11-20 08:01:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:28,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 08:01:28,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:01:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 929 proven. 12 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2024-11-20 08:01:29,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:01:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 08:01:29,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472611513] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:01:29,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 08:01:29,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-11-20 08:01:29,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993156556] [2024-11-20 08:01:29,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 08:01:29,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 08:01:29,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:01:29,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 08:01:29,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:01:29,584 INFO L87 Difference]: Start difference. First operand 131 states and 205 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 7 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 7 states have call successors, (68) [2024-11-20 08:01:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:01:29,995 INFO L93 Difference]: Finished difference Result 271 states and 417 transitions. [2024-11-20 08:01:29,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:01:29,996 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 7 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 7 states have call successors, (68) Word has length 170 [2024-11-20 08:01:29,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:01:29,999 INFO L225 Difference]: With dead ends: 271 [2024-11-20 08:01:29,999 INFO L226 Difference]: Without dead ends: 143 [2024-11-20 08:01:30,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:01:30,007 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 202 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:01:30,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 214 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 08:01:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-20 08:01:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2024-11-20 08:01:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 08:01:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 209 transitions. [2024-11-20 08:01:30,047 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 209 transitions. Word has length 170 [2024-11-20 08:01:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:01:30,048 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 209 transitions. [2024-11-20 08:01:30,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 7 states have call successors, (68), 3 states have call predecessors, (68), 6 states have return successors, (68), 6 states have call predecessors, (68), 7 states have call successors, (68) [2024-11-20 08:01:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 209 transitions. [2024-11-20 08:01:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 08:01:30,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:01:30,051 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] [2024-11-20 08:01:30,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 08:01:30,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:01:30,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:01:30,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:01:30,256 INFO L85 PathProgramCache]: Analyzing trace with hash 158292725, now seen corresponding path program 1 times [2024-11-20 08:01:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:01:30,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055419635] [2024-11-20 08:01:30,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:01:30,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:01:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 08:01:30,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1464076669] [2024-11-20 08:01:30,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:01:30,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:01:30,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:01:30,385 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-11-20 08:01:30,388 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-11-20 08:01:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:01:30,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:01:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:01:30,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:01:30,699 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:01:30,700 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:01:30,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 08:01:30,902 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,SelfDestructingSolverStorable2 [2024-11-20 08:01:30,906 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 08:01:31,024 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:01:31,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:01:31 BoogieIcfgContainer [2024-11-20 08:01:31,028 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:01:31,029 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:01:31,029 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:01:31,029 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:01:31,032 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:01:26" (3/4) ... [2024-11-20 08:01:31,036 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:01:31,037 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:01:31,037 INFO L158 Benchmark]: Toolchain (without parser) took 5443.01ms. Allocated memory was 142.6MB in the beginning and 232.8MB in the end (delta: 90.2MB). Free memory was 72.5MB in the beginning and 77.0MB in the end (delta: -4.6MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2024-11-20 08:01:31,038 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:01:31,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.68ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 57.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 08:01:31,038 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.57ms. Allocated memory is still 142.6MB. Free memory was 57.0MB in the beginning and 54.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 08:01:31,039 INFO L158 Benchmark]: Boogie Preprocessor took 64.96ms. Allocated memory is still 142.6MB. Free memory was 54.6MB in the beginning and 51.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:01:31,039 INFO L158 Benchmark]: RCFGBuilder took 598.32ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 51.2MB in the beginning and 145.7MB in the end (delta: -94.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-11-20 08:01:31,039 INFO L158 Benchmark]: TraceAbstraction took 4359.45ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 145.7MB in the beginning and 78.0MB in the end (delta: 67.6MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. [2024-11-20 08:01:31,040 INFO L158 Benchmark]: Witness Printer took 7.89ms. Allocated memory is still 232.8MB. Free memory was 78.0MB in the beginning and 77.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:01:31,041 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.15ms. Allocated memory is still 142.6MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.68ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 57.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.57ms. Allocated memory is still 142.6MB. Free memory was 57.0MB in the beginning and 54.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.96ms. Allocated memory is still 142.6MB. Free memory was 54.6MB in the beginning and 51.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 598.32ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 51.2MB in the beginning and 145.7MB in the end (delta: -94.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4359.45ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 145.7MB in the beginning and 78.0MB in the end (delta: 67.6MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. * Witness Printer took 7.89ms. Allocated memory is still 232.8MB. Free memory was 78.0MB in the beginning and 77.0MB in the end (delta: 1.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 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryArithmeticFLOAToperation at line 50. 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; VAL [isInitial=0, 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_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L88] var_1_6 = __VERIFIER_nondet_uchar() [L89] 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_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_7=0, var_1_8=0, var_1_9=0] [L89] 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_7=0, var_1_8=0, var_1_9=0] [L90] 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_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_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L90] 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_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] 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_6=0, var_1_7=1, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L92] 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_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] 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_6=0, var_1_7=1, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] 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_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L94] var_1_9 = __VERIFIER_nondet_short() [L95] 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_6=0, var_1_7=1, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L95] 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L96] 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_6=0, var_1_7=1, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L96] 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L97] var_1_10 = __VERIFIER_nondet_short() [L98] 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_6=0, var_1_7=1, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L98] 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L99] 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_6=0, var_1_7=1, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L99] 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L100] var_1_12 = __VERIFIER_nondet_char() [L101] 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=-62, 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_6=0, var_1_7=1, 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=-62, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L101] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L102] 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=-62, 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_6=0, var_1_7=1, 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=-62, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L102] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L103] var_1_13 = __VERIFIER_nondet_char() [L104] 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=-62, var_1_13=63, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L104] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L105] 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=-62, var_1_13=63, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L105] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L106] var_1_14 = __VERIFIER_nondet_char() [L107] 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=-62, var_1_13=63, var_1_14=63, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L107] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L108] 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=-62, var_1_13=63, var_1_14=63, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L108] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L109] var_1_15 = __VERIFIER_nondet_char() [L110] 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=-62, var_1_13=63, var_1_14=63, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L111] 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=-62, var_1_13=63, var_1_14=63, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L111] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L112] var_1_16 = __VERIFIER_nondet_char() [L113] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L113] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L114] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L114] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L115] var_1_17 = __VERIFIER_nondet_char() [L116] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L116] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L117] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L117] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L118] var_1_19 = __VERIFIER_nondet_char() [L119] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L119] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L120] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L120] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L121] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L121] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L122] var_1_22 = __VERIFIER_nondet_short() [L123] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L123] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L124] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L124] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L125] var_1_24 = __VERIFIER_nondet_float() [L126] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L126] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L127] var_1_25 = __VERIFIER_nondet_float() [L128] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L128] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L129] var_1_26 = __VERIFIER_nondet_float() [L130] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L130] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L143] RET updateVariables() [L144] CALL step() [L47] var_1_8 = (var_1_9 - (2 + var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L48] COND TRUE var_1_22 != var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L49] COND TRUE var_1_10 <= var_1_17 [L50] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L55] COND TRUE ! ((var_1_9 - var_1_22) > var_1_12) [L56] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L58] COND FALSE !(var_1_23 == var_1_23) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, 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_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L63] COND TRUE (- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23) [L64] 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=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L68] COND FALSE !(\read(var_1_18)) [L71] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L73] COND TRUE \read(var_1_1) [L74] 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=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] 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) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=-62, var_1_13=63, var_1_14=63, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 3, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 276 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 245 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 170 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 852 NumberOfCodeBlocks, 852 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 676 ConstructedInterpolants, 0 QuantifiedInterpolants, 1345 SizeOfPredicates, 3 NumberOfNonLiveVariables, 381 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6012/6048 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-11-20 08:01:31,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_operatoramount_amount50_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 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:01:33,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:01:33,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:01:33,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:01:33,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:01:33,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:01:33,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:01:33,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:01:33,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:01:33,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:01:33,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:01:33,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:01:33,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:01:33,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:01:33,366 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:01:33,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:01:33,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:01:33,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:01:33,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:01:33,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:01:33,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:01:33,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:01:33,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:01:33,373 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:01:33,373 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:01:33,373 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:01:33,373 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:01:33,373 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:01:33,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:01:33,374 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:01:33,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:01:33,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:01:33,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:01:33,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:01:33,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:01:33,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:01:33,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:01:33,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:01:33,378 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:01:33,378 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:01:33,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:01:33,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:01:33,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:01:33,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:01:33,380 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 -> 0177e90d070972ca52b9fa04613ebb53ecd8133d0210186e26b35ee415591bc2 [2024-11-20 08:01:33,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:01:33,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:01:33,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:01:33,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:01:33,720 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:01:33,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-11-20 08:01:35,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:01:35,535 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:01:35,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-11-20 08:01:35,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d9090ead/698192629f6140cea197dc9e5aed40f7/FLAG5a085cbdf [2024-11-20 08:01:35,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d9090ead/698192629f6140cea197dc9e5aed40f7 [2024-11-20 08:01:35,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:01:35,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:01:35,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:01:35,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:01:35,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:01:35,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:01:35" (1/1) ... [2024-11-20 08:01:35,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f079027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:35, skipping insertion in model container [2024-11-20 08:01:35,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:01:35" (1/1) ... [2024-11-20 08:01:35,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:01:36,157 WARN L250 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_operatoramount_amount50_file-29.i[915,928] [2024-11-20 08:01:36,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:01:36,262 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:01:36,278 WARN L250 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_operatoramount_amount50_file-29.i[915,928] [2024-11-20 08:01:36,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:01:36,344 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:01:36,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:36 WrapperNode [2024-11-20 08:01:36,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:01:36,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:01:36,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:01:36,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:01:36,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:36" (1/1) ... [2024-11-20 08:01:36,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:36" (1/1) ... [2024-11-20 08:01:36,403 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-11-20 08:01:36,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:01:36,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:01:36,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:01:36,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:01:36,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:36" (1/1) ... [2024-11-20 08:01:36,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:36" (1/1) ... [2024-11-20 08:01:36,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:36" (1/1) ... [2024-11-20 08:01:36,448 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-11-20 08:01:36,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:36" (1/1) ... [2024-11-20 08:01:36,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:36" (1/1) ... [2024-11-20 08:01:36,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:36" (1/1) ... [2024-11-20 08:01:36,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:36" (1/1) ... [2024-11-20 08:01:36,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:36" (1/1) ... [2024-11-20 08:01:36,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:36" (1/1) ... [2024-11-20 08:01:36,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:01:36,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:01:36,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:01:36,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:01:36,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:36" (1/1) ... [2024-11-20 08:01:36,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:01:36,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:01:36,521 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-11-20 08:01:36,525 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-11-20 08:01:36,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:01:36,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:01:36,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:01:36,571 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:01:36,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:01:36,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:01:36,679 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:01:36,682 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:01:39,011 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 08:01:39,012 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:01:39,032 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:01:39,032 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:01:39,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:01:39 BoogieIcfgContainer [2024-11-20 08:01:39,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:01:39,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:01:39,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:01:39,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:01:39,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:01:35" (1/3) ... [2024-11-20 08:01:39,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6093ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:01:39, skipping insertion in model container [2024-11-20 08:01:39,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:01:36" (2/3) ... [2024-11-20 08:01:39,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6093ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:01:39, skipping insertion in model container [2024-11-20 08:01:39,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:01:39" (3/3) ... [2024-11-20 08:01:39,045 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-29.i [2024-11-20 08:01:39,063 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:01:39,063 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:01:39,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:01:39,139 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;@6d51ca4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:01:39,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:01:39,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 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-11-20 08:01:39,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 08:01:39,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:01:39,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] [2024-11-20 08:01:39,167 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:01:39,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:01:39,175 INFO L85 PathProgramCache]: Analyzing trace with hash 731389584, now seen corresponding path program 1 times [2024-11-20 08:01:39,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:01:39,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143289667] [2024-11-20 08:01:39,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:01:39,210 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-11-20 08:01:39,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:01:39,214 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-11-20 08:01:39,215 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-11-20 08:01:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:39,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 08:01:39,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:01:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-20 08:01:39,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:01:39,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:01:39,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143289667] [2024-11-20 08:01:39,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143289667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:01:39,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [547676179] [2024-11-20 08:01:39,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:01:39,983 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 08:01:39,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 08:01:40,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 08:01:40,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-20 08:01:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:40,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 08:01:40,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:01:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 08:01:41,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:01:41,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [547676179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:01:41,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:01:41,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-20 08:01:41,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005346688] [2024-11-20 08:01:41,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:01:41,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:01:41,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:01:41,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:01:41,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:01:41,050 INFO L87 Difference]: Start difference. First operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 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 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-11-20 08:01:42,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 08:01:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:01:42,537 INFO L93 Difference]: Finished difference Result 202 states and 380 transitions. [2024-11-20 08:01:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:01:42,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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 170 [2024-11-20 08:01:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:01:42,567 INFO L225 Difference]: With dead ends: 202 [2024-11-20 08:01:42,568 INFO L226 Difference]: Without dead ends: 133 [2024-11-20 08:01:42,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 345 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-11-20 08:01:42,580 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 20 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:01:42,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 201 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 08:01:42,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-20 08:01:42,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-20 08:01:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 08:01:42,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 205 transitions. [2024-11-20 08:01:42,665 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 205 transitions. Word has length 170 [2024-11-20 08:01:42,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:01:42,670 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 205 transitions. [2024-11-20 08:01:42,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-11-20 08:01:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 205 transitions. [2024-11-20 08:01:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 08:01:42,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:01:42,678 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] [2024-11-20 08:01:42,698 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-11-20 08:01:42,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-20 08:01:43,079 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,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-20 08:01:43,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:01:43,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:01:43,080 INFO L85 PathProgramCache]: Analyzing trace with hash 788647886, now seen corresponding path program 1 times [2024-11-20 08:01:43,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:01:43,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438494141] [2024-11-20 08:01:43,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:01:43,082 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-11-20 08:01:43,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:01:43,085 INFO L229 MonitoredProcess]: Starting monitored process 4 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-11-20 08:01:43,086 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 (4)] Waiting until timeout for monitored process [2024-11-20 08:01:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:43,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 08:01:43,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:01:43,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-20 08:01:43,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:01:43,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:01:43,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438494141] [2024-11-20 08:01:43,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438494141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:01:43,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1781240808] [2024-11-20 08:01:43,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:01:43,670 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 08:01:43,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 08:01:43,673 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 08:01:43,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-20 08:01:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:44,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 08:01:44,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:01:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 08:01:44,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:01:44,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1781240808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:01:44,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:01:44,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-20 08:01:44,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474251461] [2024-11-20 08:01:44,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:01:44,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:01:44,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:01:44,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:01:44,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:01:44,453 INFO L87 Difference]: Start difference. First operand 131 states and 205 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-11-20 08:01:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:01:46,391 INFO L93 Difference]: Finished difference Result 385 states and 605 transitions. [2024-11-20 08:01:46,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:01:46,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 170 [2024-11-20 08:01:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:01:46,396 INFO L225 Difference]: With dead ends: 385 [2024-11-20 08:01:46,396 INFO L226 Difference]: Without dead ends: 257 [2024-11-20 08:01:46,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 345 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-11-20 08:01:46,398 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 95 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-20 08:01:46,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 281 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-20 08:01:46,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-20 08:01:46,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2024-11-20 08:01:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 138 states have internal predecessors, (174), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-20 08:01:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 398 transitions. [2024-11-20 08:01:46,456 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 398 transitions. Word has length 170 [2024-11-20 08:01:46,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:01:46,458 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 398 transitions. [2024-11-20 08:01:46,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-11-20 08:01:46,458 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 398 transitions. [2024-11-20 08:01:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-20 08:01:46,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:01:46,462 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] [2024-11-20 08:01:46,477 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 (4)] Forceful destruction successful, exit code 0 [2024-11-20 08:01:46,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-20 08:01:46,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-20 08:01:46,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:01:46,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:01:46,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1731312048, now seen corresponding path program 1 times [2024-11-20 08:01:46,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:01:46,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181579610] [2024-11-20 08:01:46,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:01:46,866 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-11-20 08:01:46,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:01:46,867 INFO L229 MonitoredProcess]: Starting monitored process 6 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-11-20 08:01:46,868 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 (6)] Waiting until timeout for monitored process [2024-11-20 08:01:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:47,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 08:01:47,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:01:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-20 08:01:47,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:01:47,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:01:47,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181579610] [2024-11-20 08:01:47,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181579610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:01:47,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [145462593] [2024-11-20 08:01:47,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:01:47,455 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 08:01:47,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 08:01:47,458 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 08:01:47,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-20 08:01:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:01:48,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 08:01:48,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:01:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 183 proven. 3 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-20 08:01:48,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:01:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 08:01:49,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [145462593] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:01:49,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 08:01:49,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2024-11-20 08:01:49,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362027963] [2024-11-20 08:01:49,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 08:01:49,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 08:01:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:01:49,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 08:01:49,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:01:49,496 INFO L87 Difference]: Start difference. First operand 255 states and 398 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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-11-20 08:02:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:02:01,014 INFO L93 Difference]: Finished difference Result 701 states and 1052 transitions. [2024-11-20 08:02:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-20 08:02:01,016 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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 170 [2024-11-20 08:02:01,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:02:01,021 INFO L225 Difference]: With dead ends: 701 [2024-11-20 08:02:01,021 INFO L226 Difference]: Without dead ends: 449 [2024-11-20 08:02:01,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2024-11-20 08:02:01,025 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 310 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:02:01,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 316 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2024-11-20 08:02:01,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-20 08:02:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 291. [2024-11-20 08:02:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 166 states have (on average 1.2048192771084338) internal successors, (200), 166 states have internal predecessors, (200), 112 states have call successors, (112), 12 states have call predecessors, (112), 12 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-20 08:02:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 424 transitions. [2024-11-20 08:02:01,097 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 424 transitions. Word has length 170 [2024-11-20 08:02:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:02:01,098 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 424 transitions. [2024-11-20 08:02:01,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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-11-20 08:02:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 424 transitions. [2024-11-20 08:02:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-20 08:02:01,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:02:01,110 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] [2024-11-20 08:02:01,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-20 08:02:01,321 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 (6)] Forceful destruction successful, exit code 0 [2024-11-20 08:02:01,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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-11-20 08:02:01,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:02:01,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:02:01,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1933300087, now seen corresponding path program 1 times [2024-11-20 08:02:01,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:02:01,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931993727] [2024-11-20 08:02:01,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:02:01,513 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-11-20 08:02:01,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:02:01,535 INFO L229 MonitoredProcess]: Starting monitored process 8 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-11-20 08:02:01,536 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 (8)] Waiting until timeout for monitored process [2024-11-20 08:02:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:02:01,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 08:02:01,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:02:15,290 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