./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_fillercodestructure_filler-ps-co_file-40.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 c1a30c7987036306ce2fad3ebef934b37016c19afc75444966cf4efa356e43a6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:20:39,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:20:39,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:20:39,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:20:39,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:20:39,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:20:39,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:20:39,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:20:39,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:20:39,311 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:20:39,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:20:39,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:20:39,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:20:39,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:20:39,313 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:20:39,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:20:39,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:20:39,314 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:20:39,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:20:39,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:20:39,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:20:39,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:20:39,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:20:39,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:20:39,321 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:20:39,322 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:20:39,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:20:39,322 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:20:39,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:20:39,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:20:39,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:20:39,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:20:39,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:20:39,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:20:39,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:20:39,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:20:39,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:20:39,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:20:39,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:20:39,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:20:39,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:20:39,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:20:39,326 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 -> c1a30c7987036306ce2fad3ebef934b37016c19afc75444966cf4efa356e43a6 [2024-11-10 06:20:39,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:20:39,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:20:39,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:20:39,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:20:39,658 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:20:39,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-40.i [2024-11-10 06:20:41,340 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:20:41,560 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:20:41,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-40.i [2024-11-10 06:20:41,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591a1ff30/5da675f4083b4c248df2eeaa326414d9/FLAGf2614967c [2024-11-10 06:20:41,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591a1ff30/5da675f4083b4c248df2eeaa326414d9 [2024-11-10 06:20:41,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:20:41,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:20:41,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:20:41,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:20:41,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:20:41,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:20:41" (1/1) ... [2024-11-10 06:20:41,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5dd41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:41, skipping insertion in model container [2024-11-10 06:20:41,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:20:41" (1/1) ... [2024-11-10 06:20:41,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:20:42,146 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_fillercodestructure_filler-ps-co_file-40.i[919,932] [2024-11-10 06:20:42,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:20:42,253 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:20:42,265 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_fillercodestructure_filler-ps-co_file-40.i[919,932] [2024-11-10 06:20:42,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:20:42,334 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:20:42,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:42 WrapperNode [2024-11-10 06:20:42,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:20:42,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:20:42,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:20:42,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:20:42,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:42" (1/1) ... [2024-11-10 06:20:42,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:42" (1/1) ... [2024-11-10 06:20:42,405 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-10 06:20:42,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:20:42,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:20:42,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:20:42,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:20:42,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:42" (1/1) ... [2024-11-10 06:20:42,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:42" (1/1) ... [2024-11-10 06:20:42,421 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:42" (1/1) ... [2024-11-10 06:20:42,442 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-10 06:20:42,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:42" (1/1) ... [2024-11-10 06:20:42,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:42" (1/1) ... [2024-11-10 06:20:42,464 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:42" (1/1) ... [2024-11-10 06:20:42,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:42" (1/1) ... [2024-11-10 06:20:42,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:42" (1/1) ... [2024-11-10 06:20:42,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:42" (1/1) ... [2024-11-10 06:20:42,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:20:42,492 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:20:42,492 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:20:42,492 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:20:42,500 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:42" (1/1) ... [2024-11-10 06:20:42,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:20:42,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:20:42,541 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-10 06:20:42,544 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-10 06:20:42,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:20:42,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:20:42,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:20:42,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:20:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:20:42,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:20:42,800 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:20:42,803 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:20:43,359 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 06:20:43,360 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:20:43,387 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:20:43,388 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:20:43,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:20:43 BoogieIcfgContainer [2024-11-10 06:20:43,389 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:20:43,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:20:43,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:20:43,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:20:43,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:20:41" (1/3) ... [2024-11-10 06:20:43,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59bb54f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:20:43, skipping insertion in model container [2024-11-10 06:20:43,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:42" (2/3) ... [2024-11-10 06:20:43,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59bb54f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:20:43, skipping insertion in model container [2024-11-10 06:20:43,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:20:43" (3/3) ... [2024-11-10 06:20:43,401 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-40.i [2024-11-10 06:20:43,422 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:20:43,423 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:20:43,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:20:43,516 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;@2691521c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:20:43,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:20:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 06:20:43,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 06:20:43,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:20:43,537 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:20:43,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:20:43,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:20:43,543 INFO L85 PathProgramCache]: Analyzing trace with hash -265458405, now seen corresponding path program 1 times [2024-11-10 06:20:43,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:20:43,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152190350] [2024-11-10 06:20:43,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:20:43,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:20:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:43,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:20:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:43,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:20:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:43,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:20:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:43,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:20:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:43,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:20:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:43,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:20:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:43,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:20:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:43,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:20:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:43,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:20:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:43,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:20:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:43,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:20:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:43,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:20:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:43,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:20:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:20:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:20:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:20:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:20:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:20:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:20:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:20:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:20:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:20:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:20:44,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:20:44,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152190350] [2024-11-10 06:20:44,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152190350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:20:44,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:20:44,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:20:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733322840] [2024-11-10 06:20:44,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:20:44,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:20:44,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:20:44,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:20:44,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:20:44,112 INFO L87 Difference]: Start difference. First operand has 83 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:20:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:20:44,161 INFO L93 Difference]: Finished difference Result 158 states and 269 transitions. [2024-11-10 06:20:44,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:20:44,165 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 153 [2024-11-10 06:20:44,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:20:44,177 INFO L225 Difference]: With dead ends: 158 [2024-11-10 06:20:44,177 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 06:20:44,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-10 06:20:44,188 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:20:44,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:20:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 06:20:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-10 06:20:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 06:20:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2024-11-10 06:20:44,259 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 118 transitions. Word has length 153 [2024-11-10 06:20:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:20:44,261 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 118 transitions. [2024-11-10 06:20:44,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:20:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 118 transitions. [2024-11-10 06:20:44,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 06:20:44,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:20:44,269 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:20:44,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:20:44,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:20:44,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:20:44,272 INFO L85 PathProgramCache]: Analyzing trace with hash -624820696, now seen corresponding path program 1 times [2024-11-10 06:20:44,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:20:44,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148046111] [2024-11-10 06:20:44,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:20:44,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:20:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:20:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:20:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:20:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:20:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:20:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:20:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:20:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:20:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:20:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:20:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:20:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:20:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:20:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:20:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:20:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:20:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:20:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:20:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:20:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:20:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:20:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:20:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:20:44,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:20:44,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148046111] [2024-11-10 06:20:44,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148046111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:20:44,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:20:44,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:20:44,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035483430] [2024-11-10 06:20:44,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:20:44,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:20:44,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:20:44,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:20:44,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:20:44,864 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:20:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:20:44,908 INFO L93 Difference]: Finished difference Result 153 states and 233 transitions. [2024-11-10 06:20:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:20:44,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-11-10 06:20:44,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:20:44,912 INFO L225 Difference]: With dead ends: 153 [2024-11-10 06:20:44,915 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 06:20:44,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:20:44,918 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:20:44,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:20:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 06:20:44,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-10 06:20:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 06:20:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 117 transitions. [2024-11-10 06:20:44,937 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 117 transitions. Word has length 154 [2024-11-10 06:20:44,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:20:44,940 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 117 transitions. [2024-11-10 06:20:44,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:20:44,940 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 117 transitions. [2024-11-10 06:20:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 06:20:44,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:20:44,945 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:20:44,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:20:44,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:20:44,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:20:44,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1862692137, now seen corresponding path program 1 times [2024-11-10 06:20:44,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:20:44,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306658339] [2024-11-10 06:20:44,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:20:44,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:20:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:20:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:20:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:20:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:20:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:20:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:20:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:20:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:20:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:20:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:20:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:20:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:20:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:20:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:20:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:20:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:20:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:20:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:20:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:20:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:20:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:20:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:20:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:20:45,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:20:45,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306658339] [2024-11-10 06:20:45,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306658339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:20:45,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:20:45,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:20:45,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344586579] [2024-11-10 06:20:45,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:20:45,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:20:45,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:20:45,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:20:45,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:20:45,549 INFO L87 Difference]: Start difference. First operand 78 states and 117 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:20:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:20:45,645 INFO L93 Difference]: Finished difference Result 214 states and 328 transitions. [2024-11-10 06:20:45,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:20:45,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-11-10 06:20:45,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:20:45,651 INFO L225 Difference]: With dead ends: 214 [2024-11-10 06:20:45,652 INFO L226 Difference]: Without dead ends: 139 [2024-11-10 06:20:45,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:20:45,654 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:20:45,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 211 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:20:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-10 06:20:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129. [2024-11-10 06:20:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 06:20:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 197 transitions. [2024-11-10 06:20:45,686 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 197 transitions. Word has length 154 [2024-11-10 06:20:45,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:20:45,687 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 197 transitions. [2024-11-10 06:20:45,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:20:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 197 transitions. [2024-11-10 06:20:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 06:20:45,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:20:45,692 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:20:45,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:20:45,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:20:45,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:20:45,694 INFO L85 PathProgramCache]: Analyzing trace with hash 710346364, now seen corresponding path program 1 times [2024-11-10 06:20:45,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:20:45,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197970619] [2024-11-10 06:20:45,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:20:45,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:20:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:20:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:20:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:20:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:20:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:20:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:20:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:20:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:20:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:20:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:20:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:20:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:20:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:20:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:20:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:20:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:20:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:20:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:20:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:20:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:20:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:20:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:20:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:20:46,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:20:46,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197970619] [2024-11-10 06:20:46,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197970619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:20:46,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:20:46,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:20:46,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103957015] [2024-11-10 06:20:46,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:20:46,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:20:46,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:20:46,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:20:46,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:20:46,583 INFO L87 Difference]: Start difference. First operand 129 states and 197 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:20:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:20:46,973 INFO L93 Difference]: Finished difference Result 273 states and 400 transitions. [2024-11-10 06:20:46,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:20:46,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2024-11-10 06:20:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:20:46,978 INFO L225 Difference]: With dead ends: 273 [2024-11-10 06:20:46,978 INFO L226 Difference]: Without dead ends: 198 [2024-11-10 06:20:46,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 06:20:46,984 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 122 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:20:46,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 323 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:20:46,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-10 06:20:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 167. [2024-11-10 06:20:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 109 states have (on average 1.2935779816513762) internal successors, (141), 110 states have internal predecessors, (141), 53 states have call successors, (53), 4 states have call predecessors, (53), 4 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-10 06:20:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 247 transitions. [2024-11-10 06:20:47,029 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 247 transitions. Word has length 155 [2024-11-10 06:20:47,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:20:47,030 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 247 transitions. [2024-11-10 06:20:47,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:20:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2024-11-10 06:20:47,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 06:20:47,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:20:47,032 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:20:47,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:20:47,032 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:20:47,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:20:47,035 INFO L85 PathProgramCache]: Analyzing trace with hash 738975515, now seen corresponding path program 1 times [2024-11-10 06:20:47,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:20:47,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145171240] [2024-11-10 06:20:47,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:20:47,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:20:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:20:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:20:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:20:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:20:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:20:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:20:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:20:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:20:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 06:20:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:20:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 06:20:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:20:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:20:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:20:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:20:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:20:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:20:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:20:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:20:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:20:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:20:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:20:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 24 proven. 39 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-10 06:20:47,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:20:47,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145171240] [2024-11-10 06:20:47,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145171240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:20:47,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165367510] [2024-11-10 06:20:47,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:20:47,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:20:47,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:20:47,436 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-10 06:20:47,439 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-10 06:20:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:47,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 06:20:47,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:20:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 453 proven. 39 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-10 06:20:47,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:20:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 24 proven. 39 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-10 06:20:48,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165367510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:20:48,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:20:48,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 06:20:48,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503089489] [2024-11-10 06:20:48,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:20:48,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 06:20:48,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:20:48,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 06:20:48,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:20:48,148 INFO L87 Difference]: Start difference. First operand 167 states and 247 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 06:20:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:20:48,347 INFO L93 Difference]: Finished difference Result 265 states and 379 transitions. [2024-11-10 06:20:48,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 06:20:48,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 155 [2024-11-10 06:20:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:20:48,350 INFO L225 Difference]: With dead ends: 265 [2024-11-10 06:20:48,351 INFO L226 Difference]: Without dead ends: 156 [2024-11-10 06:20:48,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 350 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 06:20:48,352 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 86 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:20:48,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 203 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:20:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-10 06:20:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2024-11-10 06:20:48,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 93 states have internal predecessors, (116), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 06:20:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 204 transitions. [2024-11-10 06:20:48,377 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 204 transitions. Word has length 155 [2024-11-10 06:20:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:20:48,378 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 204 transitions. [2024-11-10 06:20:48,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 06:20:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 204 transitions. [2024-11-10 06:20:48,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 06:20:48,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:20:48,380 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:20:48,400 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-10 06:20:48,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:20:48,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:20:48,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:20:48,582 INFO L85 PathProgramCache]: Analyzing trace with hash 868058234, now seen corresponding path program 1 times [2024-11-10 06:20:48,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:20:48,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542628528] [2024-11-10 06:20:48,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:20:48,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:20:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:20:48,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [31583133] [2024-11-10 06:20:48,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:20:48,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:20:48,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:20:48,678 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:20:48,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 06:20:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:20:49,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:20:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:20:49,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:20:49,300 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:20:49,301 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:20:49,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 06:20:49,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 06:20:49,508 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 06:20:49,655 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:20:49,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:20:49 BoogieIcfgContainer [2024-11-10 06:20:49,658 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:20:49,663 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:20:49,663 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:20:49,663 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:20:49,667 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:20:43" (3/4) ... [2024-11-10 06:20:49,671 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:20:49,675 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:20:49,678 INFO L158 Benchmark]: Toolchain (without parser) took 7750.97ms. Allocated memory was 178.3MB in the beginning and 222.3MB in the end (delta: 44.0MB). Free memory was 107.5MB in the beginning and 75.4MB in the end (delta: 32.1MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. [2024-11-10 06:20:49,678 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:20:49,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.23ms. Allocated memory is still 178.3MB. Free memory was 107.2MB in the beginning and 89.8MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 06:20:49,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.42ms. Allocated memory is still 178.3MB. Free memory was 89.8MB in the beginning and 85.1MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 06:20:49,680 INFO L158 Benchmark]: Boogie Preprocessor took 84.99ms. Allocated memory is still 178.3MB. Free memory was 85.1MB in the beginning and 77.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 06:20:49,682 INFO L158 Benchmark]: IcfgBuilder took 896.72ms. Allocated memory is still 178.3MB. Free memory was 77.9MB in the beginning and 123.0MB in the end (delta: -45.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 06:20:49,683 INFO L158 Benchmark]: TraceAbstraction took 6269.30ms. Allocated memory was 178.3MB in the beginning and 222.3MB in the end (delta: 44.0MB). Free memory was 121.9MB in the beginning and 75.4MB in the end (delta: 46.4MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. [2024-11-10 06:20:49,683 INFO L158 Benchmark]: Witness Printer took 14.69ms. Allocated memory is still 222.3MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:20:49,684 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.12ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.23ms. Allocated memory is still 178.3MB. Free memory was 107.2MB in the beginning and 89.8MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.42ms. Allocated memory is still 178.3MB. Free memory was 89.8MB in the beginning and 85.1MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.99ms. Allocated memory is still 178.3MB. Free memory was 85.1MB in the beginning and 77.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 896.72ms. Allocated memory is still 178.3MB. Free memory was 77.9MB in the beginning and 123.0MB in the end (delta: -45.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6269.30ms. Allocated memory was 178.3MB in the beginning and 222.3MB in the end (delta: 44.0MB). Free memory was 121.9MB in the beginning and 75.4MB in the end (delta: 46.4MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. * Witness Printer took 14.69ms. Allocated memory is still 222.3MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someUnaryDOUBLEoperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] unsigned char var_1_33 = 8; [L42] unsigned long int var_1_34 = 50; [L43] double var_1_35 = 31.1; [L44] double var_1_36 = 127.4; [L45] unsigned long int var_1_37 = 64; [L46] signed long int var_1_38 = 8; [L47] float var_1_39 = 200.6; [L48] unsigned short int var_1_40 = 2; [L49] signed char var_1_42 = -4; [L50] double var_1_43 = 2.75; [L51] double var_1_44 = 7.6; [L52] signed char var_1_45 = 32; [L53] unsigned long int var_1_46 = 32; [L54] signed long int var_1_47 = -256; [L55] unsigned char last_1_var_1_9 = 1; [L56] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L174] isInitial = 1 [L175] FCALL initially() [L176] COND TRUE 1 [L177] CALL updateLastVariables() [L166] last_1_var_1_9 = var_1_9 [L167] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L177] RET updateLastVariables() [L178] CALL updateVariables() [L130] var_1_4 = __VERIFIER_nondet_short() [L131] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L131] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L132] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L133] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L133] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=5, var_1_9=1] [L134] var_1_8 = __VERIFIER_nondet_ushort() [L135] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_9=1] [L135] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L137] var_1_10 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L140] var_1_11 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L142] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L142] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L143] var_1_15 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L145] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L145] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L146] var_1_20 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L148] var_1_28 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L151] var_1_29 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L153] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L154] var_1_33 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L155] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L156] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L156] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L159] var_1_39 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L160] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L161] CALL assume_abort_if_not(var_1_39 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L161] RET assume_abort_if_not(var_1_39 != 0.0F) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L162] var_1_44 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L163] RET assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L178] RET updateVariables() [L179] CALL step() [L60] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=0, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L61] COND TRUE var_1_9 && var_1_9 [L62] var_1_30 = (((((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))) < 0 ) ? -((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))) : ((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L64] COND FALSE !(var_1_28 > var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L69] var_1_35 = var_1_36 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L70] COND TRUE (var_1_9 && var_1_9) && (var_1_12 > var_1_16) [L71] var_1_37 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L73] COND FALSE !((((((var_1_36 / var_1_39)) > (var_1_17)) ? ((var_1_36 / var_1_39)) : (var_1_17))) > 100.3) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L78] COND FALSE !(var_1_16 > ((var_1_29 >> 1) + var_1_21)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L81] COND TRUE var_1_9 || var_1_9 [L82] var_1_42 = 1 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L84] EXPR var_1_26 | var_1_21 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L84] COND TRUE var_1_28 > (var_1_26 | var_1_21) [L85] var_1_43 = ((((var_1_36) > ((((((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) < 0 ) ? -((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) : ((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))))))) ? (var_1_36) : ((((((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) < 0 ) ? -((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) : ((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44)))))))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=2, var_1_8=0, var_1_9=1] [L87] var_1_45 = var_1_28 [L88] var_1_46 = var_1_33 [L89] var_1_47 = var_1_21 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=16, var_1_46=2, var_1_47=0, var_1_4=2, var_1_8=0, var_1_9=1] [L90] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L97] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=16, var_1_46=2, var_1_47=0, var_1_4=2, var_1_8=0, var_1_9=1] [L99] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=16, var_1_46=2, var_1_47=0, var_1_4=2, var_1_8=0, var_1_9=1] [L100] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L101] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=16, var_1_46=2, var_1_47=0, var_1_4=2, var_1_8=0, var_1_9=0] [L103] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=1, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=16, var_1_46=2, var_1_47=0, var_1_4=2, var_1_8=0, var_1_9=0] [L104] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L107] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=1, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=16, var_1_46=2, var_1_47=0, var_1_4=2, var_1_8=0, var_1_9=0] [L109] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=1, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=16, var_1_46=2, var_1_47=0, var_1_4=2, var_1_8=0, var_1_9=0] [L110] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=1, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=16, var_1_46=2, var_1_47=0, var_1_4=2, var_1_8=0, var_1_9=0] [L113] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=1, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=16, var_1_46=2, var_1_47=0, var_1_4=2, var_1_8=0, var_1_9=0] [L117] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L118] var_1_25 = var_1_20 [L119] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=16, var_1_46=2, var_1_47=0, var_1_4=2, var_1_8=0, var_1_9=0] [L120] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L121] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=16, var_1_46=2, var_1_47=0, var_1_4=2, var_1_8=0, var_1_9=0] [L125] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=16, var_1_46=2, var_1_47=0, var_1_4=2, var_1_8=0, var_1_9=0] [L179] RET step() [L180] CALL, EXPR property() [L170-L171] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=16, var_1_46=2, var_1_47=0, var_1_4=2, var_1_8=0, var_1_9=0] [L180] RET, EXPR property() [L180] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=16, var_1_46=2, var_1_47=0, var_1_4=2, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_15=1, var_1_16=1, var_1_17=127/5, var_1_1=1, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=1, var_1_27=14, var_1_28=16, var_1_29=2, var_1_30=2, var_1_33=-766, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=16, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=16, var_1_46=2, var_1_47=0, var_1_4=2, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 266 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 259 mSDsluCounter, 1080 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 522 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 281 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 558 mSDtfsCounter, 281 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 576 GetRequests, 560 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=4, 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.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 53 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1236 NumberOfCodeBlocks, 1236 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1074 ConstructedInterpolants, 0 QuantifiedInterpolants, 2397 SizeOfPredicates, 1 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 6351/6468 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-10 06:20:49,733 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_fillercodestructure_filler-ps-co_file-40.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 c1a30c7987036306ce2fad3ebef934b37016c19afc75444966cf4efa356e43a6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:20:52,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:20:52,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:20:52,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:20:52,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:20:52,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:20:52,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:20:52,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:20:52,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:20:52,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:20:52,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:20:52,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:20:52,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:20:52,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:20:52,405 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:20:52,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:20:52,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:20:52,411 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:20:52,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:20:52,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:20:52,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:20:52,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:20:52,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:20:52,414 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:20:52,415 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:20:52,415 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:20:52,415 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:20:52,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:20:52,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:20:52,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:20:52,424 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:20:52,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:20:52,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:20:52,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:20:52,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:20:52,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:20:52,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:20:52,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:20:52,426 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:20:52,427 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:20:52,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:20:52,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:20:52,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:20:52,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:20:52,428 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 -> c1a30c7987036306ce2fad3ebef934b37016c19afc75444966cf4efa356e43a6 [2024-11-10 06:20:52,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:20:52,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:20:52,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:20:52,829 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:20:52,829 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:20:52,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-40.i [2024-11-10 06:20:54,604 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:20:54,882 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:20:54,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-40.i [2024-11-10 06:20:54,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a4434efc/7458489e0e544ee29783027a36b72676/FLAGaf6a330da [2024-11-10 06:20:54,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a4434efc/7458489e0e544ee29783027a36b72676 [2024-11-10 06:20:54,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:20:54,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:20:54,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:20:54,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:20:54,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:20:54,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:20:54" (1/1) ... [2024-11-10 06:20:54,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8032786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:54, skipping insertion in model container [2024-11-10 06:20:54,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:20:54" (1/1) ... [2024-11-10 06:20:54,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:20:55,214 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_fillercodestructure_filler-ps-co_file-40.i[919,932] [2024-11-10 06:20:55,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:20:55,348 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:20:55,364 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_fillercodestructure_filler-ps-co_file-40.i[919,932] [2024-11-10 06:20:55,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:20:55,444 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:20:55,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:55 WrapperNode [2024-11-10 06:20:55,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:20:55,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:20:55,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:20:55,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:20:55,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:55" (1/1) ... [2024-11-10 06:20:55,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:55" (1/1) ... [2024-11-10 06:20:55,517 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-11-10 06:20:55,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:20:55,518 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:20:55,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:20:55,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:20:55,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:55" (1/1) ... [2024-11-10 06:20:55,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:55" (1/1) ... [2024-11-10 06:20:55,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:55" (1/1) ... [2024-11-10 06:20:55,558 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-10 06:20:55,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:55" (1/1) ... [2024-11-10 06:20:55,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:55" (1/1) ... [2024-11-10 06:20:55,568 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:55" (1/1) ... [2024-11-10 06:20:55,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:55" (1/1) ... [2024-11-10 06:20:55,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:55" (1/1) ... [2024-11-10 06:20:55,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:55" (1/1) ... [2024-11-10 06:20:55,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:20:55,588 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:20:55,588 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:20:55,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:20:55,589 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:55" (1/1) ... [2024-11-10 06:20:55,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:20:55,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:20:55,631 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-10 06:20:55,635 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-10 06:20:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:20:55,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:20:55,676 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:20:55,676 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:20:55,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:20:55,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:20:55,781 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:20:55,784 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:21:05,553 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 06:21:05,554 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:21:05,573 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:21:05,574 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:21:05,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:21:05 BoogieIcfgContainer [2024-11-10 06:21:05,575 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:21:05,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:21:05,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:21:05,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:21:05,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:20:54" (1/3) ... [2024-11-10 06:21:05,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffb92b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:21:05, skipping insertion in model container [2024-11-10 06:21:05,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:55" (2/3) ... [2024-11-10 06:21:05,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffb92b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:21:05, skipping insertion in model container [2024-11-10 06:21:05,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:21:05" (3/3) ... [2024-11-10 06:21:05,586 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-40.i [2024-11-10 06:21:05,619 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:21:05,619 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:21:05,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:21:05,713 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;@1fb2201a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:21:05,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:21:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 06:21:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 06:21:05,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:21:05,734 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:21:05,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:21:05,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:21:05,740 INFO L85 PathProgramCache]: Analyzing trace with hash -471116498, now seen corresponding path program 1 times [2024-11-10 06:21:05,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:21:05,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20325684] [2024-11-10 06:21:05,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:21:05,758 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-10 06:21:05,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:21:05,760 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-10 06:21:05,782 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-10 06:21:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:06,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:21:06,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:21:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2024-11-10 06:21:06,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:21:06,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:21:06,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20325684] [2024-11-10 06:21:06,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20325684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:21:06,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:21:06,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:21:06,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071872992] [2024-11-10 06:21:06,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:21:06,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:21:06,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:21:06,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:21:06,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:21:06,943 INFO L87 Difference]: Start difference. First operand has 80 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:21:06,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:21:06,989 INFO L93 Difference]: Finished difference Result 152 states and 259 transitions. [2024-11-10 06:21:06,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:21:06,992 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 152 [2024-11-10 06:21:06,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:21:07,004 INFO L225 Difference]: With dead ends: 152 [2024-11-10 06:21:07,004 INFO L226 Difference]: Without dead ends: 75 [2024-11-10 06:21:07,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-10 06:21:07,014 INFO L432 NwaCegarLoop]: 113 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, 113 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-10 06:21:07,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:21:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-10 06:21:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-10 06:21:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 06:21:07,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2024-11-10 06:21:07,079 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 152 [2024-11-10 06:21:07,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:21:07,080 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2024-11-10 06:21:07,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-10 06:21:07,080 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2024-11-10 06:21:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 06:21:07,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:21:07,084 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:21:07,121 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-10 06:21:07,287 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-10 06:21:07,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:21:07,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:21:07,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1378368697, now seen corresponding path program 1 times [2024-11-10 06:21:07,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:21:07,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535115667] [2024-11-10 06:21:07,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:21:07,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-10 06:21:07,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:21:07,292 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-10 06:21:07,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 (3)] Waiting until timeout for monitored process [2024-11-10 06:21:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:08,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 06:21:08,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:21:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:21:19,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:21:19,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:21:19,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535115667] [2024-11-10 06:21:19,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535115667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:21:19,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:21:19,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:21:19,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149684718] [2024-11-10 06:21:19,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:21:19,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:21:19,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:21:19,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:21:19,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:21:19,449 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:21:20,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:21:20,907 INFO L93 Difference]: Finished difference Result 210 states and 322 transitions. [2024-11-10 06:21:20,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:21:20,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2024-11-10 06:21:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:21:20,912 INFO L225 Difference]: With dead ends: 210 [2024-11-10 06:21:20,912 INFO L226 Difference]: Without dead ends: 138 [2024-11-10 06:21:20,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:21:20,914 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 27 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:21:20,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 186 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 06:21:20,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-10 06:21:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 125. [2024-11-10 06:21:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 06:21:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 189 transitions. [2024-11-10 06:21:20,955 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 189 transitions. Word has length 153 [2024-11-10 06:21:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:21:20,957 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 189 transitions. [2024-11-10 06:21:20,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:21:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 189 transitions. [2024-11-10 06:21:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 06:21:20,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:21:20,960 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:21:20,992 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-10 06:21:21,161 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-10 06:21:21,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:21:21,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:21:21,163 INFO L85 PathProgramCache]: Analyzing trace with hash -878542310, now seen corresponding path program 1 times [2024-11-10 06:21:21,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:21:21,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10767000] [2024-11-10 06:21:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:21:21,164 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-10 06:21:21,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:21:21,167 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-10 06:21:21,168 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-10 06:21:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:22,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 06:21:22,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:21:24,551 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 453 proven. 39 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-10 06:21:24,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:21:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 24 proven. 39 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-10 06:21:27,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:21:27,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10767000] [2024-11-10 06:21:27,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10767000] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:21:27,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 06:21:27,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-10 06:21:27,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178106124] [2024-11-10 06:21:27,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 06:21:27,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 06:21:27,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:21:27,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 06:21:27,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:21:27,239 INFO L87 Difference]: Start difference. First operand 125 states and 189 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 06:21:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:21:29,690 INFO L93 Difference]: Finished difference Result 211 states and 309 transitions. [2024-11-10 06:21:29,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 06:21:29,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 153 [2024-11-10 06:21:29,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:21:29,712 INFO L225 Difference]: With dead ends: 211 [2024-11-10 06:21:29,712 INFO L226 Difference]: Without dead ends: 139 [2024-11-10 06:21:29,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 06:21:29,714 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 117 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:21:29,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 191 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 06:21:29,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-10 06:21:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2024-11-10 06:21:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 82 states have internal predecessors, (101), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 06:21:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 189 transitions. [2024-11-10 06:21:29,740 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 189 transitions. Word has length 153 [2024-11-10 06:21:29,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:21:29,741 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 189 transitions. [2024-11-10 06:21:29,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 06:21:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 189 transitions. [2024-11-10 06:21:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 06:21:29,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:21:29,744 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:21:29,778 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-10 06:21:29,945 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-10 06:21:29,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:21:29,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:21:29,946 INFO L85 PathProgramCache]: Analyzing trace with hash -749459591, now seen corresponding path program 1 times [2024-11-10 06:21:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:21:29,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146512239] [2024-11-10 06:21:29,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:21:29,948 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-10 06:21:29,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:21:29,951 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-10 06:21:29,952 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-10 06:21:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:30,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 06:21:30,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:21:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:21:30,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:21:30,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:21:30,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146512239] [2024-11-10 06:21:30,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146512239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:21:30,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:21:30,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:21:30,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287601708] [2024-11-10 06:21:30,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:21:30,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:21:30,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:21:30,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:21:30,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:21:30,975 INFO L87 Difference]: Start difference. First operand 131 states and 189 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:21:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:21:31,228 INFO L93 Difference]: Finished difference Result 205 states and 296 transitions. [2024-11-10 06:21:31,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:21:31,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2024-11-10 06:21:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:21:31,247 INFO L225 Difference]: With dead ends: 205 [2024-11-10 06:21:31,247 INFO L226 Difference]: Without dead ends: 131 [2024-11-10 06:21:31,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:21:31,249 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:21:31,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:21:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-10 06:21:31,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-10 06:21:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 82 states have internal predecessors, (100), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 06:21:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2024-11-10 06:21:31,280 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 153 [2024-11-10 06:21:31,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:21:31,281 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2024-11-10 06:21:31,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:21:31,282 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2024-11-10 06:21:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 06:21:31,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:21:31,284 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:21:31,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 06:21:31,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:21:31,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:21:31,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:21:31,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1738053242, now seen corresponding path program 1 times [2024-11-10 06:21:31,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:21:31,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135864987] [2024-11-10 06:21:31,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:21:31,487 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-10 06:21:31,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:21:31,490 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:21:31,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 06:21:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:32,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 06:21:32,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:21:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-10 06:21:33,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:21:33,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:21:33,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135864987] [2024-11-10 06:21:33,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135864987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:21:33,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:21:33,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:21:33,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008445147] [2024-11-10 06:21:33,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:21:33,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:21:33,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:21:33,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:21:33,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:21:33,170 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:21:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:21:36,335 INFO L93 Difference]: Finished difference Result 281 states and 399 transitions. [2024-11-10 06:21:36,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 06:21:36,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2024-11-10 06:21:36,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:21:36,340 INFO L225 Difference]: With dead ends: 281 [2024-11-10 06:21:36,340 INFO L226 Difference]: Without dead ends: 207 [2024-11-10 06:21:36,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:21:36,342 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 189 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-10 06:21:36,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 445 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-10 06:21:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-10 06:21:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 136. [2024-11-10 06:21:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 86 states have (on average 1.197674418604651) internal successors, (103), 86 states have internal predecessors, (103), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 06:21:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 191 transitions. [2024-11-10 06:21:36,382 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 191 transitions. Word has length 153 [2024-11-10 06:21:36,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:21:36,383 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 191 transitions. [2024-11-10 06:21:36,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-10 06:21:36,387 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 191 transitions. [2024-11-10 06:21:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-10 06:21:36,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:21:36,389 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:21:36,441 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 (6)] Ended with exit code 0 [2024-11-10 06:21:36,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:21:36,590 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:21:36,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:21:36,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1766682393, now seen corresponding path program 1 times [2024-11-10 06:21:36,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:21:36,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981230535] [2024-11-10 06:21:36,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:21:36,592 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-10 06:21:36,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:21:36,595 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:21:36,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 06:21:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:37,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 06:21:37,597 INFO L278 TraceCheckSpWp]: Computing forward predicates...