./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.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 053126c13ef1d8dfef0a099a2c7c76042ecd617980f87b19ee0e26ff48315beb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:01:42,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:01:42,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 02:01:42,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:01:42,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:01:42,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:01:42,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:01:42,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:01:42,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:01:42,666 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:01:42,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:01:42,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:01:42,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:01:42,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:01:42,667 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:01:42,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:01:42,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:01:42,668 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:01:42,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 02:01:42,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:01:42,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:01:42,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:01:42,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:01:42,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:01:42,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:01:42,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:01:42,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:01:42,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:01:42,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:01:42,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:01:42,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:01:42,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:01:42,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:01:42,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:01:42,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:01:42,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:01:42,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 02:01:42,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 02:01:42,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:01:42,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:01:42,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:01:42,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:01:42,673 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 -> 053126c13ef1d8dfef0a099a2c7c76042ecd617980f87b19ee0e26ff48315beb [2024-11-12 02:01:42,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:01:42,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:01:42,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:01:42,935 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:01:42,935 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:01:42,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i [2024-11-12 02:01:44,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:01:44,470 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:01:44,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i [2024-11-12 02:01:44,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ee23660/8853740ccf9442208bfed3c54d127f26/FLAGe3c0bd6ca [2024-11-12 02:01:44,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ee23660/8853740ccf9442208bfed3c54d127f26 [2024-11-12 02:01:44,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:01:44,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:01:44,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:01:44,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:01:44,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:01:44,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:01:44" (1/1) ... [2024-11-12 02:01:44,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b48e8d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:44, skipping insertion in model container [2024-11-12 02:01:44,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:01:44" (1/1) ... [2024-11-12 02:01:44,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:01:45,064 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_fillercode_fillercodesize_ps-cn-10_file-68.i[915,928] [2024-11-12 02:01:45,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:01:45,163 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:01:45,173 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_fillercode_fillercodesize_ps-cn-10_file-68.i[915,928] [2024-11-12 02:01:45,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:01:45,220 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:01:45,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:45 WrapperNode [2024-11-12 02:01:45,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:01:45,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:01:45,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:01:45,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:01:45,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:45" (1/1) ... [2024-11-12 02:01:45,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:45" (1/1) ... [2024-11-12 02:01:45,280 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-11-12 02:01:45,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:01:45,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:01:45,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:01:45,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:01:45,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:45" (1/1) ... [2024-11-12 02:01:45,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:45" (1/1) ... [2024-11-12 02:01:45,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:45" (1/1) ... [2024-11-12 02:01:45,317 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-12 02:01:45,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:45" (1/1) ... [2024-11-12 02:01:45,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:45" (1/1) ... [2024-11-12 02:01:45,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:45" (1/1) ... [2024-11-12 02:01:45,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:45" (1/1) ... [2024-11-12 02:01:45,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:45" (1/1) ... [2024-11-12 02:01:45,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:45" (1/1) ... [2024-11-12 02:01:45,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:01:45,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:01:45,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:01:45,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:01:45,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:45" (1/1) ... [2024-11-12 02:01:45,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:01:45,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:01:45,378 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-12 02:01:45,385 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-12 02:01:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:01:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:01:45,428 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:01:45,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 02:01:45,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:01:45,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:01:45,527 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:01:45,529 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:01:45,916 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-12 02:01:45,916 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:01:45,932 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:01:45,932 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:01:45,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:01:45 BoogieIcfgContainer [2024-11-12 02:01:45,933 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:01:45,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:01:45,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:01:45,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:01:45,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:01:44" (1/3) ... [2024-11-12 02:01:45,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38161cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:01:45, skipping insertion in model container [2024-11-12 02:01:45,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:45" (2/3) ... [2024-11-12 02:01:45,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38161cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:01:45, skipping insertion in model container [2024-11-12 02:01:45,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:01:45" (3/3) ... [2024-11-12 02:01:45,944 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-68.i [2024-11-12 02:01:45,960 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:01:45,960 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:01:46,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:01:46,026 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;@66a0671f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:01:46,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:01:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 53 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 02:01:46,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 02:01:46,049 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:46,050 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:01:46,051 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:46,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:46,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1619535571, now seen corresponding path program 1 times [2024-11-12 02:01:46,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:01:46,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280051167] [2024-11-12 02:01:46,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:46,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:01:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:01:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:01:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:01:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:01:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:01:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:01:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:01:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:01:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:01:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:01:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:01:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:01:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:01:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:01:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:01:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:01:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:01:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:01:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:01:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:01:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:01:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:01:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:01:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 02:01:46,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:01:46,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280051167] [2024-11-12 02:01:46,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280051167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:01:46,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:01:46,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 02:01:46,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510171044] [2024-11-12 02:01:46,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:01:46,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 02:01:46,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:01:46,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 02:01:46,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:01:46,755 INFO L87 Difference]: Start difference. First operand has 78 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 53 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 02:01:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:01:46,844 INFO L93 Difference]: Finished difference Result 147 states and 253 transitions. [2024-11-12 02:01:46,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 02:01:46,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-11-12 02:01:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:01:46,856 INFO L225 Difference]: With dead ends: 147 [2024-11-12 02:01:46,857 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 02:01:46,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:01:46,864 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 101 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:01:46,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 192 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:01:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 02:01:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-12 02:01:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 02:01:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2024-11-12 02:01:46,903 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 150 [2024-11-12 02:01:46,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:01:46,905 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2024-11-12 02:01:46,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 02:01:46,906 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2024-11-12 02:01:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-12 02:01:46,909 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:46,909 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:01:46,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 02:01:46,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:46,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:46,910 INFO L85 PathProgramCache]: Analyzing trace with hash 758108728, now seen corresponding path program 1 times [2024-11-12 02:01:46,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:01:46,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170469576] [2024-11-12 02:01:46,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:46,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:01:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:01:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:01:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:01:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:01:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:01:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:01:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:01:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:01:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:01:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:01:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:01:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:01:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:01:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:01:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:01:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:01:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:01:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:01:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:01:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:01:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:01:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:01:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:01:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 02:01:47,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:01:47,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170469576] [2024-11-12 02:01:47,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170469576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:01:47,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:01:47,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 02:01:47,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904707080] [2024-11-12 02:01:47,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:01:47,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 02:01:47,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:01:47,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 02:01:47,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:01:47,771 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 02:01:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:01:48,569 INFO L93 Difference]: Finished difference Result 303 states and 451 transitions. [2024-11-12 02:01:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 02:01:48,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2024-11-12 02:01:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:01:48,573 INFO L225 Difference]: With dead ends: 303 [2024-11-12 02:01:48,578 INFO L226 Difference]: Without dead ends: 234 [2024-11-12 02:01:48,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-12 02:01:48,580 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 235 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 02:01:48,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 620 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 02:01:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-12 02:01:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 133. [2024-11-12 02:01:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 84 states have internal predecessors, (106), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-12 02:01:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 198 transitions. [2024-11-12 02:01:48,619 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 198 transitions. Word has length 151 [2024-11-12 02:01:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:01:48,620 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 198 transitions. [2024-11-12 02:01:48,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 02:01:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 198 transitions. [2024-11-12 02:01:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-12 02:01:48,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:48,622 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:01:48,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 02:01:48,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:48,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:48,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1451014486, now seen corresponding path program 1 times [2024-11-12 02:01:48,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:01:48,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076197763] [2024-11-12 02:01:48,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:48,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:01:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:48,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:01:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:48,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:01:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:01:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:48,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:01:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:48,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:01:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:48,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:01:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:01:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:01:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:01:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:01:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:01:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:01:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:01:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:01:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:01:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:01:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:01:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:01:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:01:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 02:01:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:01:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:01:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:01:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 02:01:49,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:01:49,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076197763] [2024-11-12 02:01:49,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076197763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:01:49,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:01:49,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 02:01:49,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788968230] [2024-11-12 02:01:49,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:01:49,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 02:01:49,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:01:49,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 02:01:49,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:01:49,073 INFO L87 Difference]: Start difference. First operand 133 states and 198 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 02:01:49,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:01:49,494 INFO L93 Difference]: Finished difference Result 279 states and 405 transitions. [2024-11-12 02:01:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 02:01:49,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2024-11-12 02:01:49,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:01:49,496 INFO L225 Difference]: With dead ends: 279 [2024-11-12 02:01:49,497 INFO L226 Difference]: Without dead ends: 210 [2024-11-12 02:01:49,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-12 02:01:49,498 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 210 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 02:01:49,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 472 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 02:01:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-12 02:01:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 138. [2024-11-12 02:01:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-12 02:01:49,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 203 transitions. [2024-11-12 02:01:49,532 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 203 transitions. Word has length 152 [2024-11-12 02:01:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:01:49,533 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 203 transitions. [2024-11-12 02:01:49,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 02:01:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 203 transitions. [2024-11-12 02:01:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-12 02:01:49,538 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:49,538 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:01:49,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 02:01:49,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:49,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1255604908, now seen corresponding path program 1 times [2024-11-12 02:01:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:01:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657738929] [2024-11-12 02:01:49,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:49,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:01:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 02:01:49,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177509222] [2024-11-12 02:01:49,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:49,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:01:49,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:01:49,619 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-12 02:01:49,620 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-12 02:01:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:01:49,743 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 02:01:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:01:49,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 02:01:49,868 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 02:01:49,869 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 02:01:49,888 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-12 02:01:50,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:01:50,075 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 02:01:50,176 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 02:01:50,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:01:50 BoogieIcfgContainer [2024-11-12 02:01:50,181 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 02:01:50,182 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 02:01:50,182 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 02:01:50,182 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 02:01:50,182 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:01:45" (3/4) ... [2024-11-12 02:01:50,184 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 02:01:50,185 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 02:01:50,187 INFO L158 Benchmark]: Toolchain (without parser) took 5329.47ms. Allocated memory was 178.3MB in the beginning and 237.0MB in the end (delta: 58.7MB). Free memory was 122.7MB in the beginning and 142.1MB in the end (delta: -19.4MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-11-12 02:01:50,187 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:01:50,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.52ms. Allocated memory is still 178.3MB. Free memory was 122.3MB in the beginning and 145.6MB in the end (delta: -23.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 02:01:50,188 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.38ms. Allocated memory is still 178.3MB. Free memory was 145.6MB in the beginning and 142.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 02:01:50,189 INFO L158 Benchmark]: Boogie Preprocessor took 59.97ms. Allocated memory is still 178.3MB. Free memory was 142.4MB in the beginning and 137.1MB in the end (delta: 5.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 02:01:50,190 INFO L158 Benchmark]: RCFGBuilder took 591.60ms. Allocated memory is still 178.3MB. Free memory was 137.1MB in the beginning and 112.0MB in the end (delta: 25.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-12 02:01:50,191 INFO L158 Benchmark]: TraceAbstraction took 4247.21ms. Allocated memory was 178.3MB in the beginning and 237.0MB in the end (delta: 58.7MB). Free memory was 110.9MB in the beginning and 143.2MB in the end (delta: -32.2MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-11-12 02:01:50,191 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 237.0MB. Free memory was 143.2MB in the beginning and 142.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 02:01:50,192 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.16ms. Allocated memory is still 96.5MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.52ms. Allocated memory is still 178.3MB. Free memory was 122.3MB in the beginning and 145.6MB in the end (delta: -23.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.38ms. Allocated memory is still 178.3MB. Free memory was 145.6MB in the beginning and 142.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.97ms. Allocated memory is still 178.3MB. Free memory was 142.4MB in the beginning and 137.1MB in the end (delta: 5.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 591.60ms. Allocated memory is still 178.3MB. Free memory was 137.1MB in the beginning and 112.0MB in the end (delta: 25.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4247.21ms. Allocated memory was 178.3MB in the beginning and 237.0MB in the end (delta: 58.7MB). Free memory was 110.9MB in the beginning and 143.2MB in the end (delta: -32.2MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 237.0MB. Free memory was 143.2MB in the beginning and 142.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryFLOATComparisonOperation at line 157, overapproximation of someUnaryDOUBLEoperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 32; [L27] double var_1_9 = 4.6; [L28] double var_1_10 = 9.25; [L29] double var_1_11 = 1.25; [L30] unsigned char var_1_12 = 100; [L31] unsigned char var_1_13 = 64; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 7.5; [L34] signed long int var_1_16 = 0; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned char var_1_20 = 0; [L39] double var_1_21 = 4.65; [L40] signed long int var_1_22 = 256; [L41] signed long int var_1_23 = 64; [L42] unsigned char var_1_24 = 5; [L43] unsigned char var_1_25 = 2; [L44] signed short int var_1_26 = 10; [L45] double var_1_27 = 16.8; [L46] double var_1_28 = 10.6; [L47] float var_1_29 = 8.25; [L48] signed char var_1_30 = 8; [L49] signed char var_1_31 = 1; [L50] double last_1_var_1_9 = 4.6; [L51] unsigned char last_1_var_1_12 = 100; [L52] unsigned char last_1_var_1_14 = 0; [L53] signed long int last_1_var_1_16 = 0; VAL [isInitial=0, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L161] isInitial = 1 [L162] FCALL initially() [L163] COND TRUE 1 [L164] CALL updateLastVariables() [L151] last_1_var_1_9 = var_1_9 [L152] last_1_var_1_12 = var_1_12 [L153] last_1_var_1_14 = var_1_14 [L154] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L164] RET updateLastVariables() [L165] CALL updateVariables() [L114] var_1_5 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L115] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L116] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L116] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L117] var_1_7 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L118] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L119] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L119] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L120] var_1_8 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L121] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L122] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L122] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L123] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L123] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L124] var_1_10 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L125] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L126] var_1_13 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L127] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L128] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L128] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L129] var_1_18 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L130] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L131] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L131] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L132] var_1_19 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L133] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L134] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L134] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L135] var_1_20 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L136] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L137] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L137] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L138] var_1_23 = __VERIFIER_nondet_long() [L139] CALL assume_abort_if_not(var_1_23 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L139] RET assume_abort_if_not(var_1_23 >= -2147483647) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L140] CALL assume_abort_if_not(var_1_23 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L140] RET assume_abort_if_not(var_1_23 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L141] var_1_25 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L142] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L143] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L143] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_28=53/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L144] var_1_28 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_28 >= -922337.2036854765600e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L145] RET assume_abort_if_not((var_1_28 >= -922337.2036854765600e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L146] var_1_31 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L147] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L148] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L148] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=256, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=10, var_1_27=84/5, var_1_29=33/4, var_1_30=8, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L165] RET updateVariables() [L166] CALL step() [L57] var_1_17 = (var_1_18 || (var_1_19 && var_1_20)) [L58] var_1_21 = -0.5 [L59] var_1_22 = var_1_23 [L60] var_1_24 = var_1_25 [L61] var_1_26 = var_1_25 [L62] var_1_27 = var_1_28 [L63] var_1_29 = var_1_28 [L64] var_1_30 = var_1_31 [L65] signed long int stepLocal_4 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L66] COND FALSE !(\read(last_1_var_1_14)) [L77] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L79] var_1_16 = last_1_var_1_12 [L80] unsigned long int stepLocal_6 = var_1_13 % (5u + 256u); [L81] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, stepLocal_6=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L82] COND TRUE stepLocal_6 <= var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L83] COND FALSE !(stepLocal_5 >= var_1_16) [L86] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L89] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L90] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L90] COND TRUE stepLocal_0 <= (var_1_12 ^ var_1_12) [L91] var_1_1 = (! var_1_5) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L95] unsigned char stepLocal_2 = var_1_12 < (var_1_16 / var_1_8); [L96] signed long int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_1=100, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L97] COND FALSE !(-256 >= stepLocal_1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=49, var_1_9=23/5] [L100] COND TRUE stepLocal_2 || ((var_1_5 && var_1_7) && var_1_1) [L101] var_1_6 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=49, var_1_9=23/5] [L104] unsigned char stepLocal_3 = ! var_1_5; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_3=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=49, var_1_9=23/5] [L105] COND TRUE (var_1_7 && var_1_14) || stepLocal_3 [L106] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=49, var_1_9=23/5] [L108] var_1_15 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=49, var_1_9=23/5] [L109] COND TRUE ((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8) [L110] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=49, var_1_9=3] [L166] RET step() [L167] CALL, EXPR property() [L157] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=49, var_1_9=3] [L157-L158] return ((((((((var_1_12 <= (var_1_12 ^ var_1_12)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_16) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_12 < (var_1_16 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_14) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (last_1_var_1_14 ? ((var_1_10 >= (- last_1_var_1_9)) ? ((var_1_8 != last_1_var_1_16) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_16) ? (((var_1_13 + 16) >= var_1_16) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) last_1_var_1_12)) ; [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=49, var_1_9=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=2, var_1_28=2, var_1_29=2, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=49, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 546 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 546 mSDsluCounter, 1284 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 898 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 724 IncrementalHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 386 mSDtfsCounter, 724 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=3, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 173 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 757 NumberOfCodeBlocks, 757 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 450 ConstructedInterpolants, 0 QuantifiedInterpolants, 1275 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3036/3036 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-12 02:01:50,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.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 053126c13ef1d8dfef0a099a2c7c76042ecd617980f87b19ee0e26ff48315beb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:01:52,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:01:52,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 02:01:52,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:01:52,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:01:52,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:01:52,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:01:52,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:01:52,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:01:52,441 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:01:52,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:01:52,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:01:52,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:01:52,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:01:52,444 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:01:52,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:01:52,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:01:52,445 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:01:52,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:01:52,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:01:52,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:01:52,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:01:52,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:01:52,447 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 02:01:52,447 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 02:01:52,447 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:01:52,448 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 02:01:52,448 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:01:52,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:01:52,448 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:01:52,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:01:52,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:01:52,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:01:52,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:01:52,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:01:52,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:01:52,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:01:52,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:01:52,453 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 02:01:52,453 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 02:01:52,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:01:52,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:01:52,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:01:52,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:01:52,455 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 -> 053126c13ef1d8dfef0a099a2c7c76042ecd617980f87b19ee0e26ff48315beb [2024-11-12 02:01:52,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:01:52,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:01:52,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:01:52,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:01:52,792 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:01:52,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i [2024-11-12 02:01:54,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:01:54,505 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:01:54,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-68.i [2024-11-12 02:01:54,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a5a9931/02a90e2d9b8646fd8fde04beb85ad5cd/FLAGd214cc634 [2024-11-12 02:01:54,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a5a9931/02a90e2d9b8646fd8fde04beb85ad5cd [2024-11-12 02:01:54,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:01:54,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:01:54,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:01:54,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:01:54,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:01:54,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:01:54" (1/1) ... [2024-11-12 02:01:54,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@529ae63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:54, skipping insertion in model container [2024-11-12 02:01:54,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:01:54" (1/1) ... [2024-11-12 02:01:54,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:01:54,741 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_fillercode_fillercodesize_ps-cn-10_file-68.i[915,928] [2024-11-12 02:01:54,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:01:54,828 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:01:54,842 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_fillercode_fillercodesize_ps-cn-10_file-68.i[915,928] [2024-11-12 02:01:54,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:01:54,920 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:01:54,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:54 WrapperNode [2024-11-12 02:01:54,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:01:54,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:01:54,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:01:54,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:01:54,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:54" (1/1) ... [2024-11-12 02:01:54,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:54" (1/1) ... [2024-11-12 02:01:54,963 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-11-12 02:01:54,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:01:54,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:01:54,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:01:54,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:01:54,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:54" (1/1) ... [2024-11-12 02:01:54,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:54" (1/1) ... [2024-11-12 02:01:54,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:54" (1/1) ... [2024-11-12 02:01:54,987 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-12 02:01:54,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:54" (1/1) ... [2024-11-12 02:01:54,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:54" (1/1) ... [2024-11-12 02:01:54,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:54" (1/1) ... [2024-11-12 02:01:54,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:54" (1/1) ... [2024-11-12 02:01:55,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:54" (1/1) ... [2024-11-12 02:01:55,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:54" (1/1) ... [2024-11-12 02:01:55,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:01:55,014 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:01:55,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:01:55,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:01:55,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:54" (1/1) ... [2024-11-12 02:01:55,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:01:55,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:01:55,052 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-12 02:01:55,055 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-12 02:01:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:01:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 02:01:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:01:55,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:01:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:01:55,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:01:55,170 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:01:55,172 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:01:55,939 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-12 02:01:55,939 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:01:55,954 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:01:55,955 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:01:55,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:01:55 BoogieIcfgContainer [2024-11-12 02:01:55,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:01:55,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:01:55,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:01:55,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:01:55,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:01:54" (1/3) ... [2024-11-12 02:01:55,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3101be6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:01:55, skipping insertion in model container [2024-11-12 02:01:55,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:01:54" (2/3) ... [2024-11-12 02:01:55,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3101be6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:01:55, skipping insertion in model container [2024-11-12 02:01:55,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:01:55" (3/3) ... [2024-11-12 02:01:55,965 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-68.i [2024-11-12 02:01:55,980 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:01:55,981 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:01:56,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:01:56,076 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;@33786a14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:01:56,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:01:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 02:01:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-12 02:01:56,094 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:56,095 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:01:56,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:56,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash 107542208, now seen corresponding path program 1 times [2024-11-12 02:01:56,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:01:56,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548226154] [2024-11-12 02:01:56,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:56,116 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-12 02:01:56,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:01:56,120 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-12 02:01:56,121 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-12 02:01:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:56,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 02:01:56,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:01:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-12 02:01:56,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:01:56,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:01:56,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548226154] [2024-11-12 02:01:56,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548226154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:01:56,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:01:56,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:01:56,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331495455] [2024-11-12 02:01:56,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:01:56,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:01:56,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:01:56,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:01:56,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:01:56,484 INFO L87 Difference]: Start difference. First operand has 69 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 02:01:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:01:56,513 INFO L93 Difference]: Finished difference Result 131 states and 225 transitions. [2024-11-12 02:01:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:01:56,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2024-11-12 02:01:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:01:56,522 INFO L225 Difference]: With dead ends: 131 [2024-11-12 02:01:56,522 INFO L226 Difference]: Without dead ends: 65 [2024-11-12 02:01:56,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:01:56,528 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:01:56,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:01:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-12 02:01:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-12 02:01:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 02:01:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions. [2024-11-12 02:01:56,575 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 97 transitions. Word has length 147 [2024-11-12 02:01:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:01:56,576 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 97 transitions. [2024-11-12 02:01:56,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 02:01:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 97 transitions. [2024-11-12 02:01:56,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-12 02:01:56,585 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:01:56,585 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:01:56,594 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-12 02:01:56,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:01:56,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:01:56,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:01:56,788 INFO L85 PathProgramCache]: Analyzing trace with hash -182342534, now seen corresponding path program 1 times [2024-11-12 02:01:56,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:01:56,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540913499] [2024-11-12 02:01:56,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:01:56,789 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-12 02:01:56,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:01:56,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:01:56,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 02:01:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:01:57,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 02:01:57,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:01:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 02:01:57,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:01:57,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:01:57,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540913499] [2024-11-12 02:01:57,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540913499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:01:57,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:01:57,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 02:01:57,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862565186] [2024-11-12 02:01:57,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:01:57,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 02:01:57,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:01:57,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 02:01:57,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 02:01:57,605 INFO L87 Difference]: Start difference. First operand 65 states and 97 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 02:02:00,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:02:00,172 INFO L93 Difference]: Finished difference Result 268 states and 401 transitions. [2024-11-12 02:02:00,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 02:02:00,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2024-11-12 02:02:00,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:02:00,183 INFO L225 Difference]: With dead ends: 268 [2024-11-12 02:02:00,183 INFO L226 Difference]: Without dead ends: 206 [2024-11-12 02:02:00,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-12 02:02:00,185 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 176 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-12 02:02:00,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 446 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-12 02:02:00,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-12 02:02:00,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 113. [2024-11-12 02:02:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-12 02:02:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2024-11-12 02:02:00,213 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 147 [2024-11-12 02:02:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:02:00,215 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 171 transitions. [2024-11-12 02:02:00,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 02:02:00,215 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 171 transitions. [2024-11-12 02:02:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-12 02:02:00,217 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:02:00,217 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:02:00,225 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 (3)] Ended with exit code 0 [2024-11-12 02:02:00,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:02:00,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:02:00,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:02:00,422 INFO L85 PathProgramCache]: Analyzing trace with hash 518722044, now seen corresponding path program 1 times [2024-11-12 02:02:00,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:02:00,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263156724] [2024-11-12 02:02:00,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:02:00,423 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-12 02:02:00,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:02:00,425 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-12 02:02:00,426 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-12 02:02:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:02:00,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 02:02:00,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:02:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 02:02:00,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:02:00,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:02:00,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263156724] [2024-11-12 02:02:00,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263156724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:02:00,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:02:00,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 02:02:00,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637814222] [2024-11-12 02:02:00,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:02:00,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 02:02:00,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:02:00,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 02:02:00,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:02:00,644 INFO L87 Difference]: Start difference. First operand 113 states and 171 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 02:02:01,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:02:01,020 INFO L93 Difference]: Finished difference Result 175 states and 265 transitions. [2024-11-12 02:02:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 02:02:01,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2024-11-12 02:02:01,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:02:01,038 INFO L225 Difference]: With dead ends: 175 [2024-11-12 02:02:01,039 INFO L226 Difference]: Without dead ends: 113 [2024-11-12 02:02:01,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:02:01,058 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 91 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 02:02:01,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 171 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 02:02:01,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-12 02:02:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-12 02:02:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-12 02:02:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2024-11-12 02:02:01,085 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 147 [2024-11-12 02:02:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:02:01,085 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2024-11-12 02:02:01,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 02:02:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2024-11-12 02:02:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 02:02:01,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:02:01,087 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:02:01,095 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 (4)] Ended with exit code 0 [2024-11-12 02:02:01,288 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 [2024-11-12 02:02:01,288 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:02:01,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:02:01,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1164182648, now seen corresponding path program 1 times [2024-11-12 02:02:01,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:02:01,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095216961] [2024-11-12 02:02:01,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:02:01,290 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-12 02:02:01,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:02:01,292 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:02:01,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 02:02:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:02:01,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 02:02:01,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:02:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 395 proven. 108 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2024-11-12 02:02:02,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:02:03,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:02:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095216961] [2024-11-12 02:02:03,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095216961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:02:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [141342451] [2024-11-12 02:02:03,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:02:03,957 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 02:02:03,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 02:02:03,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 02:02:03,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-12 02:02:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:02:04,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 02:02:04,849 INFO L279 TraceCheckSpWp]: Computing forward predicates...