./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.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 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:43:03,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:43:03,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:43:03,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:43:03,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:43:03,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:43:03,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:43:03,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:43:03,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:43:03,378 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:43:03,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:43:03,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:43:03,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:43:03,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:43:03,380 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:43:03,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:43:03,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:43:03,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:43:03,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:43:03,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:43:03,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:43:03,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:43:03,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:43:03,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:43:03,385 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:43:03,385 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:43:03,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:43:03,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:43:03,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:43:03,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:43:03,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:43:03,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:43:03,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:43:03,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:43:03,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:43:03,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:43:03,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:43:03,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:43:03,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:43:03,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:43:03,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:43:03,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:43:03,389 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 -> 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 [2024-10-13 00:43:03,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:43:03,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:43:03,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:43:03,712 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:43:03,712 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:43:03,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-10-13 00:43:05,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:43:05,331 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:43:05,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-10-13 00:43:05,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbb2754e/cfa10b7452fa4ae7bab41f75b0f24228/FLAG69bcf57a5 [2024-10-13 00:43:05,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbb2754e/cfa10b7452fa4ae7bab41f75b0f24228 [2024-10-13 00:43:05,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:43:05,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:43:05,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:43:05,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:43:05,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:43:05,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:43:05" (1/1) ... [2024-10-13 00:43:05,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@638292cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:05, skipping insertion in model container [2024-10-13 00:43:05,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:43:05" (1/1) ... [2024-10-13 00:43:05,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:43:05,557 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i[915,928] [2024-10-13 00:43:05,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:43:05,654 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:43:05,669 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i[915,928] [2024-10-13 00:43:05,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:43:05,739 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:43:05,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:05 WrapperNode [2024-10-13 00:43:05,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:43:05,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:43:05,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:43:05,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:43:05,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:05" (1/1) ... [2024-10-13 00:43:05,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:05" (1/1) ... [2024-10-13 00:43:05,804 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2024-10-13 00:43:05,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:43:05,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:43:05,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:43:05,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:43:05,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:05" (1/1) ... [2024-10-13 00:43:05,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:05" (1/1) ... [2024-10-13 00:43:05,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:05" (1/1) ... [2024-10-13 00:43:05,862 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:43:05,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:05" (1/1) ... [2024-10-13 00:43:05,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:05" (1/1) ... [2024-10-13 00:43:05,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:05" (1/1) ... [2024-10-13 00:43:05,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:05" (1/1) ... [2024-10-13 00:43:05,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:05" (1/1) ... [2024-10-13 00:43:05,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:05" (1/1) ... [2024-10-13 00:43:05,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:43:05,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:43:05,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:43:05,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:43:05,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:05" (1/1) ... [2024-10-13 00:43:05,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:43:05,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:43:05,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:43:05,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:43:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:43:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:43:05,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:43:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:43:05,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:43:05,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:43:06,063 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:43:06,065 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:43:06,520 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 00:43:06,521 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:43:06,551 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:43:06,551 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:43:06,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:43:06 BoogieIcfgContainer [2024-10-13 00:43:06,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:43:06,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:43:06,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:43:06,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:43:06,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:43:05" (1/3) ... [2024-10-13 00:43:06,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118f400f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:43:06, skipping insertion in model container [2024-10-13 00:43:06,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:05" (2/3) ... [2024-10-13 00:43:06,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118f400f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:43:06, skipping insertion in model container [2024-10-13 00:43:06,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:43:06" (3/3) ... [2024-10-13 00:43:06,563 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-10-13 00:43:06,579 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:43:06,579 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:43:06,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:43:06,642 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;@27cef935, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:43:06,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:43:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 00:43:06,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 00:43:06,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:43:06,659 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:43:06,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:43:06,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:43:06,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1722666839, now seen corresponding path program 1 times [2024-10-13 00:43:06,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:43:06,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470072295] [2024-10-13 00:43:06,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:43:06,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:43:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:06,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:43:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:06,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:43:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:43:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:43:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:43:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:43:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:43:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:43:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:43:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:43:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:43:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:43:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:43:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:43:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:43:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:43:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:43:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:43:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:43:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:43:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:43:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:43:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:43:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 00:43:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:43:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 00:43:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 00:43:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 00:43:07,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:43:07,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470072295] [2024-10-13 00:43:07,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470072295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:43:07,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:43:07,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:43:07,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087574822] [2024-10-13 00:43:07,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:43:07,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:43:07,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:43:07,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:43:07,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:43:07,156 INFO L87 Difference]: Start difference. First operand has 69 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 00:43:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:43:07,197 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2024-10-13 00:43:07,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:43:07,200 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 167 [2024-10-13 00:43:07,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:43:07,209 INFO L225 Difference]: With dead ends: 135 [2024-10-13 00:43:07,209 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 00:43:07,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:43:07,218 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:43:07,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:43:07,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 00:43:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 00:43:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 00:43:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 104 transitions. [2024-10-13 00:43:07,271 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 104 transitions. Word has length 167 [2024-10-13 00:43:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:43:07,272 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 104 transitions. [2024-10-13 00:43:07,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 00:43:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 104 transitions. [2024-10-13 00:43:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 00:43:07,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:43:07,278 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:43:07,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:43:07,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:43:07,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:43:07,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1660213023, now seen corresponding path program 1 times [2024-10-13 00:43:07,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:43:07,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34074393] [2024-10-13 00:43:07,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:43:07,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:43:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:43:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:43:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:43:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:43:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:43:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:43:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:43:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:43:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:43:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:43:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:43:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:43:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:43:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:43:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:43:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:43:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:43:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:43:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:43:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:43:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:43:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:43:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:43:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 00:43:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:43:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 00:43:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 00:43:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 00:43:07,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:43:07,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34074393] [2024-10-13 00:43:07,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34074393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:43:07,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:43:07,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:43:07,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167586068] [2024-10-13 00:43:07,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:43:07,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:43:07,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:43:07,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:43:07,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:43:07,959 INFO L87 Difference]: Start difference. First operand 67 states and 104 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 00:43:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:43:08,201 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-10-13 00:43:08,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:43:08,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 167 [2024-10-13 00:43:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:43:08,206 INFO L225 Difference]: With dead ends: 213 [2024-10-13 00:43:08,208 INFO L226 Difference]: Without dead ends: 147 [2024-10-13 00:43:08,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:43:08,210 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 76 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:43:08,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 313 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 00:43:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-13 00:43:08,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2024-10-13 00:43:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 74 states have internal predecessors, (96), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 00:43:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 204 transitions. [2024-10-13 00:43:08,258 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 204 transitions. Word has length 167 [2024-10-13 00:43:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:43:08,259 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 204 transitions. [2024-10-13 00:43:08,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 00:43:08,260 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 204 transitions. [2024-10-13 00:43:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 00:43:08,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:43:08,265 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:43:08,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:43:08,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:43:08,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:43:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1073407009, now seen corresponding path program 1 times [2024-10-13 00:43:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:43:08,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657752363] [2024-10-13 00:43:08,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:43:08,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:43:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:43:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:43:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:43:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:43:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:43:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:43:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:43:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:43:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:43:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:43:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:43:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:43:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:43:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:43:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:43:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:43:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:43:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:43:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:43:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:43:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:43:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:43:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:43:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 00:43:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:43:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 00:43:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 00:43:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 00:43:08,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:43:08,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657752363] [2024-10-13 00:43:08,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657752363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:43:08,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:43:08,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:43:08,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300451662] [2024-10-13 00:43:08,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:43:08,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:43:08,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:43:08,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:43:08,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:43:08,614 INFO L87 Difference]: Start difference. First operand 131 states and 204 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 00:43:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:43:08,675 INFO L93 Difference]: Finished difference Result 327 states and 510 transitions. [2024-10-13 00:43:08,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:43:08,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 167 [2024-10-13 00:43:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:43:08,678 INFO L225 Difference]: With dead ends: 327 [2024-10-13 00:43:08,678 INFO L226 Difference]: Without dead ends: 197 [2024-10-13 00:43:08,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:43:08,680 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 54 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:43:08,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 195 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:43:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-13 00:43:08,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2024-10-13 00:43:08,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 110 states have (on average 1.2727272727272727) internal successors, (140), 110 states have internal predecessors, (140), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-13 00:43:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 302 transitions. [2024-10-13 00:43:08,726 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 302 transitions. Word has length 167 [2024-10-13 00:43:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:43:08,728 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 302 transitions. [2024-10-13 00:43:08,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 00:43:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 302 transitions. [2024-10-13 00:43:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 00:43:08,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:43:08,735 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:43:08,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:43:08,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:43:08,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:43:08,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1331572447, now seen corresponding path program 1 times [2024-10-13 00:43:08,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:43:08,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375642597] [2024-10-13 00:43:08,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:43:08,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:43:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:43:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:43:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:43:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:43:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:43:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:43:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:43:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:43:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:43:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:43:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:43:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:43:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:43:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:43:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:43:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:43:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:43:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:43:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:43:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:43:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:43:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:43:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:43:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 00:43:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:43:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 00:43:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 00:43:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 33 proven. 45 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-13 00:43:09,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:43:09,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375642597] [2024-10-13 00:43:09,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375642597] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:43:09,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760741084] [2024-10-13 00:43:09,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:43:09,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:43:09,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:43:09,458 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:43:09,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 00:43:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:09,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 00:43:09,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:43:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 468 proven. 294 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2024-10-13 00:43:11,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:43:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 24 proven. 270 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2024-10-13 00:43:12,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760741084] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:43:12,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 00:43:12,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 18, 16] total 33 [2024-10-13 00:43:12,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206989837] [2024-10-13 00:43:12,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 00:43:12,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-13 00:43:12,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:43:12,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-13 00:43:12,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 00:43:12,756 INFO L87 Difference]: Start difference. First operand 195 states and 302 transitions. Second operand has 33 states, 33 states have (on average 3.606060606060606) internal successors, (119), 33 states have internal predecessors, (119), 9 states have call successors, (79), 5 states have call predecessors, (79), 13 states have return successors, (81), 9 states have call predecessors, (81), 9 states have call successors, (81) [2024-10-13 00:43:15,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:43:15,005 INFO L93 Difference]: Finished difference Result 641 states and 878 transitions. [2024-10-13 00:43:15,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-13 00:43:15,006 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.606060606060606) internal successors, (119), 33 states have internal predecessors, (119), 9 states have call successors, (79), 5 states have call predecessors, (79), 13 states have return successors, (81), 9 states have call predecessors, (81), 9 states have call successors, (81) Word has length 167 [2024-10-13 00:43:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:43:15,011 INFO L225 Difference]: With dead ends: 641 [2024-10-13 00:43:15,011 INFO L226 Difference]: Without dead ends: 447 [2024-10-13 00:43:15,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2356 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1738, Invalid=5918, Unknown=0, NotChecked=0, Total=7656 [2024-10-13 00:43:15,015 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 225 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 00:43:15,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 397 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 00:43:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-13 00:43:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 361. [2024-10-13 00:43:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 230 states have (on average 1.1782608695652175) internal successors, (271), 232 states have internal predecessors, (271), 101 states have call successors, (101), 29 states have call predecessors, (101), 29 states have return successors, (101), 99 states have call predecessors, (101), 101 states have call successors, (101) [2024-10-13 00:43:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 473 transitions. [2024-10-13 00:43:15,061 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 473 transitions. Word has length 167 [2024-10-13 00:43:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:43:15,061 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 473 transitions. [2024-10-13 00:43:15,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.606060606060606) internal successors, (119), 33 states have internal predecessors, (119), 9 states have call successors, (79), 5 states have call predecessors, (79), 13 states have return successors, (81), 9 states have call predecessors, (81), 9 states have call successors, (81) [2024-10-13 00:43:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 473 transitions. [2024-10-13 00:43:15,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 00:43:15,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:43:15,064 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:43:15,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 00:43:15,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:43:15,265 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:43:15,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:43:15,266 INFO L85 PathProgramCache]: Analyzing trace with hash -386176613, now seen corresponding path program 1 times [2024-10-13 00:43:15,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:43:15,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991419035] [2024-10-13 00:43:15,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:43:15,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:43:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:43:15,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:43:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:43:15,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:43:15,488 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:43:15,489 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:43:15,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 00:43:15,493 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 00:43:15,593 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:43:15,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:43:15 BoogieIcfgContainer [2024-10-13 00:43:15,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:43:15,598 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:43:15,598 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:43:15,599 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:43:15,599 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:43:06" (3/4) ... [2024-10-13 00:43:15,601 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:43:15,602 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:43:15,603 INFO L158 Benchmark]: Toolchain (without parser) took 10239.66ms. Allocated memory was 165.7MB in the beginning and 262.1MB in the end (delta: 96.5MB). Free memory was 132.4MB in the beginning and 120.3MB in the end (delta: 12.1MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. [2024-10-13 00:43:15,604 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:43:15,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.96ms. Allocated memory is still 165.7MB. Free memory was 132.4MB in the beginning and 115.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 00:43:15,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.32ms. Allocated memory is still 165.7MB. Free memory was 114.6MB in the beginning and 109.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 00:43:15,604 INFO L158 Benchmark]: Boogie Preprocessor took 95.37ms. Allocated memory is still 165.7MB. Free memory was 109.3MB in the beginning and 97.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 00:43:15,605 INFO L158 Benchmark]: RCFGBuilder took 650.20ms. Allocated memory is still 165.7MB. Free memory was 97.8MB in the beginning and 117.1MB in the end (delta: -19.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 00:43:15,605 INFO L158 Benchmark]: TraceAbstraction took 9042.31ms. Allocated memory was 165.7MB in the beginning and 262.1MB in the end (delta: 96.5MB). Free memory was 116.1MB in the beginning and 120.3MB in the end (delta: -4.2MB). Peak memory consumption was 95.4MB. Max. memory is 16.1GB. [2024-10-13 00:43:15,609 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 262.1MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:43:15,611 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.96ms. Allocated memory is still 165.7MB. Free memory was 132.4MB in the beginning and 115.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.32ms. Allocated memory is still 165.7MB. Free memory was 114.6MB in the beginning and 109.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.37ms. Allocated memory is still 165.7MB. Free memory was 109.3MB in the beginning and 97.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 650.20ms. Allocated memory is still 165.7MB. Free memory was 97.8MB in the beginning and 117.1MB in the end (delta: -19.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9042.31ms. Allocated memory was 165.7MB in the beginning and 262.1MB in the end (delta: 96.5MB). Free memory was 116.1MB in the beginning and 120.3MB in the end (delta: -4.2MB). Peak memory consumption was 95.4MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 262.1MB. Free memory is still 120.3MB. 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 150, overapproximation of someUnaryDOUBLEoperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someUnaryFLOAToperation at line 70, overapproximation of someBinaryArithmeticFLOAToperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] unsigned char var_1_2 = 128; [L24] unsigned char var_1_3 = 64; [L25] signed short int var_1_6 = -16; [L26] unsigned short int var_1_7 = 56838; [L27] unsigned short int var_1_8 = 24612; [L28] signed short int var_1_9 = 20013; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 0; [L32] signed short int var_1_14 = 50; [L33] unsigned char var_1_15 = 0; [L34] signed short int var_1_19 = 100; [L35] double var_1_21 = 3.5; [L36] signed short int var_1_23 = -128; [L37] float var_1_24 = 10.2; [L38] float var_1_25 = 8.6; [L39] float var_1_26 = 32.7; [L40] float var_1_27 = 16.25; [L41] float var_1_28 = 8.875; [L42] unsigned short int var_1_29 = 256; [L43] double var_1_30 = 2.75; [L44] double var_1_31 = 0.0; [L45] unsigned char var_1_32 = 8; [L46] unsigned char var_1_33 = 100; [L47] double var_1_34 = 0.19999999999999996; [L48] signed char var_1_35 = -32; [L49] signed char var_1_36 = -1; [L50] signed char var_1_37 = -8; [L51] unsigned char last_1_var_1_15 = 0; [L154] isInitial = 1 [L155] FCALL initially() [L156] COND TRUE 1 [L157] CALL updateLastVariables() [L147] last_1_var_1_15 = var_1_15 [L157] RET updateLastVariables() [L158] CALL updateVariables() [L102] var_1_2 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L103] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L104] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L104] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L105] var_1_3 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L106] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L107] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L107] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L108] var_1_7 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L109] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L110] CALL assume_abort_if_not(var_1_7 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L110] RET assume_abort_if_not(var_1_7 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L111] var_1_8 = __VERIFIER_nondet_ushort() [L112] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L112] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L113] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L113] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=20013] [L114] var_1_9 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_9 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L115] RET assume_abort_if_not(var_1_9 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L116] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L116] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L117] var_1_12 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L118] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L119] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L119] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L120] var_1_13 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L121] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L122] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L122] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L123] var_1_21 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L124] RET assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L125] CALL assume_abort_if_not(var_1_21 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L125] RET assume_abort_if_not(var_1_21 != 0.0F) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L126] var_1_23 = __VERIFIER_nondet_short() [L127] CALL assume_abort_if_not(var_1_23 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L127] RET assume_abort_if_not(var_1_23 >= -16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L128] CALL assume_abort_if_not(var_1_23 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L128] RET assume_abort_if_not(var_1_23 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L129] var_1_25 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L130] RET assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L131] var_1_26 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L132] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L133] var_1_27 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L134] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L135] var_1_28 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L136] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L137] var_1_31 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L138] RET assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L139] var_1_33 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L140] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L141] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L141] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L142] var_1_37 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_37 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L143] RET assume_abort_if_not(var_1_37 >= -127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L144] CALL assume_abort_if_not(var_1_37 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L144] RET assume_abort_if_not(var_1_37 <= 126) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L158] RET updateVariables() [L159] CALL step() [L55] var_1_30 = ((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31))) [L56] var_1_32 = var_1_33 [L57] var_1_34 = var_1_31 [L58] var_1_35 = -1 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L59] COND FALSE !(var_1_31 <= var_1_34) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L64] COND FALSE !(\read(last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L67] COND FALSE !(\read(var_1_10)) [L70] var_1_24 = ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L72] COND TRUE (- var_1_24) == (var_1_24 + var_1_24) [L73] var_1_15 = var_1_12 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L75] COND FALSE !(var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) [L82] var_1_19 = var_1_2 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L84] COND TRUE var_1_24 != var_1_24 [L85] var_1_29 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L87] signed long int stepLocal_1 = var_1_7 - (var_1_8 - var_1_2); VAL [isInitial=1, last_1_var_1_15=0, stepLocal_1=127, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L88] COND TRUE stepLocal_1 >= var_1_29 [L89] var_1_6 = (var_1_3 - (var_1_9 - var_1_2)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16129, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L91] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16129, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L94] signed long int stepLocal_0 = var_1_2 - var_1_3; VAL [isInitial=1, last_1_var_1_15=0, stepLocal_0=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=-64, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16129, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L95] COND TRUE stepLocal_0 <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6))) [L96] var_1_1 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16129, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L159] RET step() [L160] CALL, EXPR property() [L150-L151] return (((((((((var_1_2 - var_1_3) <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6)))) ? (var_1_1 == ((signed long int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : (var_1_1 == ((signed long int) var_1_2))) && (((var_1_7 - (var_1_8 - var_1_2)) >= var_1_29) ? (var_1_6 == ((signed short int) (var_1_3 - (var_1_9 - var_1_2)))) : 1)) && (last_1_var_1_15 ? (var_1_10 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && (var_1_15 ? (var_1_14 == ((signed short int) (((((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) < (var_1_9)) ? ((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) : (var_1_9))))) : 1)) && (((- var_1_24) == (var_1_24 + var_1_24)) ? (var_1_15 == ((unsigned char) var_1_12)) : 1)) && ((var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) ? (var_1_10 ? (var_1_19 == ((signed short int) (var_1_3 + ((((var_1_2) < (var_1_23)) ? (var_1_2) : (var_1_23)))))) : (var_1_19 == ((signed short int) (var_1_3 - 8)))) : (var_1_19 == ((signed short int) var_1_2)))) && (var_1_10 ? (var_1_24 == ((float) ((((var_1_25) > (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))))) ? (var_1_25) : (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26)))))))) : (var_1_24 == ((float) ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))))))) && ((var_1_24 != var_1_24) ? (var_1_29 == ((unsigned short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : 1) ; [L160] RET, EXPR property() [L160] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16129, var_1_7=32767, var_1_8=32767, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=127, var_1_1=127, var_1_23=16383, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=126, var_1_3=127, var_1_6=-16129, var_1_7=32767, var_1_8=32767, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 1006 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 626 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 788 IncrementalHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 380 mSDtfsCounter, 788 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 558 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2356 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=4, InterpolantAutomatonStates: 69, 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, 4 MinimizatonAttempts, 104 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1002 NumberOfCodeBlocks, 1002 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 996 ConstructedInterpolants, 0 QuantifiedInterpolants, 5333 SizeOfPredicates, 11 NumberOfNonLiveVariables, 388 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 7815/8424 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 00:43:15,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.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 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:43:17,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:43:17,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:43:17,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:43:17,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:43:18,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:43:18,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:43:18,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:43:18,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:43:18,021 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:43:18,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:43:18,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:43:18,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:43:18,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:43:18,026 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:43:18,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:43:18,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:43:18,027 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:43:18,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:43:18,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:43:18,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:43:18,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:43:18,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:43:18,029 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:43:18,030 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:43:18,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:43:18,031 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:43:18,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:43:18,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:43:18,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:43:18,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:43:18,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:43:18,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:43:18,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:43:18,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:43:18,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:43:18,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:43:18,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:43:18,035 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:43:18,035 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:43:18,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:43:18,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:43:18,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:43:18,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:43:18,036 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:43:18,037 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 -> 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 [2024-10-13 00:43:18,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:43:18,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:43:18,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:43:18,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:43:18,384 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:43:18,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-10-13 00:43:19,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:43:20,029 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:43:20,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-10-13 00:43:20,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/970920138/bb74a7c932564e5bbb9ccaf84ea6a500/FLAG740ce44d9 [2024-10-13 00:43:20,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/970920138/bb74a7c932564e5bbb9ccaf84ea6a500 [2024-10-13 00:43:20,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:43:20,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:43:20,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:43:20,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:43:20,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:43:20,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:43:20" (1/1) ... [2024-10-13 00:43:20,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e22fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:20, skipping insertion in model container [2024-10-13 00:43:20,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:43:20" (1/1) ... [2024-10-13 00:43:20,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:43:20,307 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i[915,928] [2024-10-13 00:43:20,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:43:20,421 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:43:20,433 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i[915,928] [2024-10-13 00:43:20,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:43:20,500 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:43:20,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:20 WrapperNode [2024-10-13 00:43:20,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:43:20,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:43:20,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:43:20,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:43:20,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:20" (1/1) ... [2024-10-13 00:43:20,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:20" (1/1) ... [2024-10-13 00:43:20,567 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-10-13 00:43:20,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:43:20,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:43:20,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:43:20,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:43:20,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:20" (1/1) ... [2024-10-13 00:43:20,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:20" (1/1) ... [2024-10-13 00:43:20,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:20" (1/1) ... [2024-10-13 00:43:20,601 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:43:20,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:20" (1/1) ... [2024-10-13 00:43:20,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:20" (1/1) ... [2024-10-13 00:43:20,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:20" (1/1) ... [2024-10-13 00:43:20,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:20" (1/1) ... [2024-10-13 00:43:20,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:20" (1/1) ... [2024-10-13 00:43:20,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:20" (1/1) ... [2024-10-13 00:43:20,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:43:20,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:43:20,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:43:20,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:43:20,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:20" (1/1) ... [2024-10-13 00:43:20,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:43:20,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:43:20,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:43:20,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:43:20,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:43:20,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:43:20,721 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:43:20,721 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:43:20,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:43:20,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:43:20,811 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:43:20,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:43:34,734 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 00:43:34,734 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:43:34,796 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:43:34,797 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:43:34,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:43:34 BoogieIcfgContainer [2024-10-13 00:43:34,797 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:43:34,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:43:34,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:43:34,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:43:34,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:43:20" (1/3) ... [2024-10-13 00:43:34,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364602ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:43:34, skipping insertion in model container [2024-10-13 00:43:34,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:43:20" (2/3) ... [2024-10-13 00:43:34,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364602ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:43:34, skipping insertion in model container [2024-10-13 00:43:34,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:43:34" (3/3) ... [2024-10-13 00:43:34,805 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-10-13 00:43:34,818 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:43:34,819 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:43:34,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:43:34,883 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;@1ebbf9a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:43:34,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:43:34,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 00:43:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 00:43:34,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:43:34,904 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:43:34,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:43:34,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:43:34,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1722666839, now seen corresponding path program 1 times [2024-10-13 00:43:34,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:43:34,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063358847] [2024-10-13 00:43:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:43:34,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:43:34,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:43:34,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:43:34,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 00:43:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:35,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:43:35,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:43:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 724 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2024-10-13 00:43:35,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:43:35,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:43:35,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063358847] [2024-10-13 00:43:35,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063358847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:43:35,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:43:35,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:43:35,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338278180] [2024-10-13 00:43:35,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:43:35,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:43:35,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:43:35,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:43:35,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:43:35,881 INFO L87 Difference]: Start difference. First operand has 69 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 00:43:40,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:43:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:43:40,331 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2024-10-13 00:43:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:43:40,472 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 167 [2024-10-13 00:43:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:43:40,477 INFO L225 Difference]: With dead ends: 135 [2024-10-13 00:43:40,478 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 00:43:40,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:43:40,483 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-13 00:43:40,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-13 00:43:40,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 00:43:40,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 00:43:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 00:43:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 104 transitions. [2024-10-13 00:43:40,527 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 104 transitions. Word has length 167 [2024-10-13 00:43:40,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:43:40,527 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 104 transitions. [2024-10-13 00:43:40,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 00:43:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 104 transitions. [2024-10-13 00:43:40,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 00:43:40,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:43:40,531 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:43:40,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 00:43:40,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:43:40,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:43:40,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:43:40,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1660213023, now seen corresponding path program 1 times [2024-10-13 00:43:40,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:43:40,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970049059] [2024-10-13 00:43:40,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:43:40,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:43:40,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:43:40,737 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:43:40,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 00:43:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:43:41,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 00:43:41,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:43:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 00:43:47,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:43:47,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:43:47,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970049059] [2024-10-13 00:43:47,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970049059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:43:47,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:43:47,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:43:47,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013548762] [2024-10-13 00:43:47,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:43:47,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:43:47,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:43:47,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:43:47,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:43:47,040 INFO L87 Difference]: Start difference. First operand 67 states and 104 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 00:43:51,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:43:55,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:43:59,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:44:04,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:44:08,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:44:12,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:44:16,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:44:20,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:44:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:44:20,458 INFO L93 Difference]: Finished difference Result 223 states and 343 transitions. [2024-10-13 00:44:20,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:44:20,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 167 [2024-10-13 00:44:20,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:44:20,610 INFO L225 Difference]: With dead ends: 223 [2024-10-13 00:44:20,610 INFO L226 Difference]: Without dead ends: 157 [2024-10-13 00:44:20,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:44:20,612 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 85 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 59 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:44:20,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 323 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 33.3s Time] [2024-10-13 00:44:20,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-13 00:44:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 131. [2024-10-13 00:44:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 74 states have internal predecessors, (96), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 00:44:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 204 transitions. [2024-10-13 00:44:20,656 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 204 transitions. Word has length 167 [2024-10-13 00:44:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:44:20,657 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 204 transitions. [2024-10-13 00:44:20,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 00:44:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 204 transitions. [2024-10-13 00:44:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 00:44:20,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:44:20,660 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:44:20,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 00:44:20,860 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-10-13 00:44:20,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:44:20,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:44:20,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1073407009, now seen corresponding path program 1 times [2024-10-13 00:44:20,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:44:20,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649153509] [2024-10-13 00:44:20,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:44:20,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:44:20,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:44:20,866 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-10-13 00:44:20,867 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-10-13 00:44:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:21,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 00:44:21,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:44:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 00:44:27,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:44:27,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:44:27,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649153509] [2024-10-13 00:44:27,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649153509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:44:27,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:44:27,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:44:27,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007605107] [2024-10-13 00:44:27,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:44:27,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:44:27,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:44:27,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:44:27,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:44:27,208 INFO L87 Difference]: Start difference. First operand 131 states and 204 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 00:44:31,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []