./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_codestructure_steplocals_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1515ceb6f758670420bf03659579c75f101fb2f02c9a542a1591764efdb5eeab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:33:45,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:33:45,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:33:45,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:33:45,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:33:45,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:33:45,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:33:45,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:33:45,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:33:45,376 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:33:45,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:33:45,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:33:45,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:33:45,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:33:45,381 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:33:45,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:33:45,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:33:45,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:33:45,383 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:33:45,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:33:45,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:33:45,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:33:45,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:33:45,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:33:45,389 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:33:45,389 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:33:45,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:33:45,389 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:33:45,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:33:45,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:33:45,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:33:45,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:33:45,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:33:45,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:33:45,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:33:45,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:33:45,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:33:45,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:33:45,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:33:45,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:33:45,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:33:45,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:33:45,395 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-clean/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-clean/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 -> 1515ceb6f758670420bf03659579c75f101fb2f02c9a542a1591764efdb5eeab [2024-10-11 07:33:45,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:33:45,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:33:45,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:33:45,702 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:33:45,702 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:33:45,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i [2024-10-11 07:33:47,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:33:47,434 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:33:47,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i [2024-10-11 07:33:47,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ccb79657e/59d64910700d4738bfcdecb553b34886/FLAGcc2a101f3 [2024-10-11 07:33:47,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ccb79657e/59d64910700d4738bfcdecb553b34886 [2024-10-11 07:33:47,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:33:47,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:33:47,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:33:47,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:33:47,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:33:47,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:33:47" (1/1) ... [2024-10-11 07:33:47,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5febdd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:47, skipping insertion in model container [2024-10-11 07:33:47,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:33:47" (1/1) ... [2024-10-11 07:33:47,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:33:47,691 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_codestructure_steplocals_file-53.i[917,930] [2024-10-11 07:33:47,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:33:47,760 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:33:47,770 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_codestructure_steplocals_file-53.i[917,930] [2024-10-11 07:33:47,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:33:47,822 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:33:47,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:47 WrapperNode [2024-10-11 07:33:47,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:33:47,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:33:47,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:33:47,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:33:47,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:47" (1/1) ... [2024-10-11 07:33:47,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:47" (1/1) ... [2024-10-11 07:33:47,881 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-10-11 07:33:47,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:33:47,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:33:47,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:33:47,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:33:47,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:47" (1/1) ... [2024-10-11 07:33:47,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:47" (1/1) ... [2024-10-11 07:33:47,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:47" (1/1) ... [2024-10-11 07:33:47,930 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-11 07:33:47,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:47" (1/1) ... [2024-10-11 07:33:47,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:47" (1/1) ... [2024-10-11 07:33:47,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:47" (1/1) ... [2024-10-11 07:33:47,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:47" (1/1) ... [2024-10-11 07:33:47,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:47" (1/1) ... [2024-10-11 07:33:47,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:47" (1/1) ... [2024-10-11 07:33:47,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:33:47,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:33:47,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:33:47,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:33:47,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:47" (1/1) ... [2024-10-11 07:33:47,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:33:47,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:33:47,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:33:48,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:33:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:33:48,051 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:33:48,052 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:33:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:33:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:33:48,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:33:48,142 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:33:48,144 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:33:48,540 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-11 07:33:48,544 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:33:48,587 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:33:48,587 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:33:48,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:33:48 BoogieIcfgContainer [2024-10-11 07:33:48,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:33:48,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:33:48,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:33:48,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:33:48,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:33:47" (1/3) ... [2024-10-11 07:33:48,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6f668c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:33:48, skipping insertion in model container [2024-10-11 07:33:48,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:47" (2/3) ... [2024-10-11 07:33:48,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6f668c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:33:48, skipping insertion in model container [2024-10-11 07:33:48,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:33:48" (3/3) ... [2024-10-11 07:33:48,600 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-53.i [2024-10-11 07:33:48,616 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:33:48,617 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:33:48,673 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:33:48,680 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;@4514d743, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:33:48,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:33:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 07:33:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 07:33:48,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:33:48,703 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:33:48,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:33:48,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:33:48,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1107271776, now seen corresponding path program 1 times [2024-10-11 07:33:48,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:33:48,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006501154] [2024-10-11 07:33:48,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:33:48,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:33:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:33:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:33:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:33:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:33:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:33:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:33:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:33:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:33:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:33:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:33:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:33:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:33:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:33:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:33:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:33:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:33:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:33:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:33:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:33:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:33:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:33:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:33:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:33:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:33:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:33:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:33:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 07:33:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 07:33:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 07:33:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 07:33:49,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:33:49,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006501154] [2024-10-11 07:33:49,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006501154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:33:49,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:33:49,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:33:49,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068139147] [2024-10-11 07:33:49,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:33:49,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:33:49,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:33:49,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:33:49,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:33:49,354 INFO L87 Difference]: Start difference. First operand has 87 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 07:33:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:33:49,410 INFO L93 Difference]: Finished difference Result 171 states and 299 transitions. [2024-10-11 07:33:49,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:33:49,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 178 [2024-10-11 07:33:49,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:33:49,424 INFO L225 Difference]: With dead ends: 171 [2024-10-11 07:33:49,425 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 07:33:49,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-11 07:33:49,438 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:33:49,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:33:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 07:33:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 07:33:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 07:33:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 131 transitions. [2024-10-11 07:33:49,496 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 131 transitions. Word has length 178 [2024-10-11 07:33:49,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:33:49,496 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 131 transitions. [2024-10-11 07:33:49,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 07:33:49,497 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 131 transitions. [2024-10-11 07:33:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 07:33:49,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:33:49,501 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:33:49,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:33:49,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:33:49,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:33:49,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1596324970, now seen corresponding path program 1 times [2024-10-11 07:33:49,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:33:49,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649595532] [2024-10-11 07:33:49,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:33:49,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:33:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:33:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:33:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:33:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:33:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:33:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:33:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:33:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:33:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:33:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:33:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:33:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:33:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:33:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:33:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:33:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:33:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:33:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:33:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:33:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:33:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:33:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:33:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:33:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:33:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:33:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:33:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 07:33:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 07:33:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 07:33:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 07:33:49,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:33:49,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649595532] [2024-10-11 07:33:49,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649595532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:33:49,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:33:49,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:33:49,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408530957] [2024-10-11 07:33:49,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:33:49,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:33:49,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:33:49,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:33:49,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:33:49,848 INFO L87 Difference]: Start difference. First operand 85 states and 131 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 07:33:49,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:33:49,936 INFO L93 Difference]: Finished difference Result 244 states and 376 transitions. [2024-10-11 07:33:49,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:33:49,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 178 [2024-10-11 07:33:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:33:49,948 INFO L225 Difference]: With dead ends: 244 [2024-10-11 07:33:49,948 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 07:33:49,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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-11 07:33:49,950 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 121 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:33:49,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 228 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:33:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 07:33:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2024-10-11 07:33:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 07:33:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 242 transitions. [2024-10-11 07:33:50,012 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 242 transitions. Word has length 178 [2024-10-11 07:33:50,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:33:50,012 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 242 transitions. [2024-10-11 07:33:50,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 07:33:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 242 transitions. [2024-10-11 07:33:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-11 07:33:50,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:33:50,016 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:33:50,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:33:50,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:33:50,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:33:50,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1838142936, now seen corresponding path program 1 times [2024-10-11 07:33:50,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:33:50,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610951706] [2024-10-11 07:33:50,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:33:50,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:33:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:33:50,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [992359136] [2024-10-11 07:33:50,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:33:50,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:33:50,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:33:50,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:33:50,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:33:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:33:50,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 07:33:50,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:33:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 1408 trivial. 0 not checked. [2024-10-11 07:33:52,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:33:52,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:33:52,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610951706] [2024-10-11 07:33:52,824 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 07:33:52,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992359136] [2024-10-11 07:33:52,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992359136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:33:52,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:33:52,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 07:33:52,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675370078] [2024-10-11 07:33:52,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:33:52,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:33:52,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:33:52,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:33:52,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:33:52,832 INFO L87 Difference]: Start difference. First operand 158 states and 242 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 07:33:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:33:53,663 INFO L93 Difference]: Finished difference Result 403 states and 606 transitions. [2024-10-11 07:33:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:33:53,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 180 [2024-10-11 07:33:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:33:53,670 INFO L225 Difference]: With dead ends: 403 [2024-10-11 07:33:53,670 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 07:33:53,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:33:53,676 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 235 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:33:53,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 363 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 07:33:53,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 07:33:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 167. [2024-10-11 07:33:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 106 states have (on average 1.3018867924528301) internal successors, (138), 106 states have internal predecessors, (138), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 07:33:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 254 transitions. [2024-10-11 07:33:53,728 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 254 transitions. Word has length 180 [2024-10-11 07:33:53,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:33:53,730 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 254 transitions. [2024-10-11 07:33:53,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 07:33:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 254 transitions. [2024-10-11 07:33:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-11 07:33:53,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:33:53,738 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:33:53,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 07:33:53,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:33:53,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:33:53,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:33:53,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1755759782, now seen corresponding path program 1 times [2024-10-11 07:33:53,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:33:53,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993749844] [2024-10-11 07:33:53,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:33:53,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:33:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:33:54,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1539067732] [2024-10-11 07:33:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:33:54,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:33:54,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:33:54,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:33:54,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 07:33:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:33:54,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:33:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:33:54,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:33:54,396 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:33:54,397 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:33:54,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 07:33:54,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:33:54,610 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 07:33:54,740 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:33:54,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:33:54 BoogieIcfgContainer [2024-10-11 07:33:54,745 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:33:54,746 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:33:54,746 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:33:54,746 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:33:54,747 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:33:48" (3/4) ... [2024-10-11 07:33:54,749 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:33:54,750 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:33:54,751 INFO L158 Benchmark]: Toolchain (without parser) took 7280.77ms. Allocated memory was 130.0MB in the beginning and 199.2MB in the end (delta: 69.2MB). Free memory was 59.9MB in the beginning and 58.6MB in the end (delta: 1.3MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2024-10-11 07:33:54,751 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:33:54,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.46ms. Allocated memory was 130.0MB in the beginning and 165.7MB in the end (delta: 35.7MB). Free memory was 59.7MB in the beginning and 129.6MB in the end (delta: -69.9MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-11 07:33:54,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.20ms. Allocated memory is still 165.7MB. Free memory was 129.6MB in the beginning and 126.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:33:54,753 INFO L158 Benchmark]: Boogie Preprocessor took 72.54ms. Allocated memory is still 165.7MB. Free memory was 126.2MB in the beginning and 123.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:33:54,753 INFO L158 Benchmark]: RCFGBuilder took 632.53ms. Allocated memory is still 165.7MB. Free memory was 123.3MB in the beginning and 96.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 07:33:54,754 INFO L158 Benchmark]: TraceAbstraction took 6154.82ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 94.7MB in the beginning and 58.6MB in the end (delta: 36.1MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2024-10-11 07:33:54,754 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 199.2MB. Free memory is still 58.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:33:54,757 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.17ms. Allocated memory is still 130.0MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.46ms. Allocated memory was 130.0MB in the beginning and 165.7MB in the end (delta: 35.7MB). Free memory was 59.7MB in the beginning and 129.6MB in the end (delta: -69.9MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.20ms. Allocated memory is still 165.7MB. Free memory was 129.6MB in the beginning and 126.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.54ms. Allocated memory is still 165.7MB. Free memory was 126.2MB in the beginning and 123.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 632.53ms. Allocated memory is still 165.7MB. Free memory was 123.3MB in the beginning and 96.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6154.82ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 94.7MB in the beginning and 58.6MB in the end (delta: 36.1MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 199.2MB. Free memory is still 58.6MB. 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 139, overapproximation of someBinaryArithmeticFLOAToperation at line 65, overapproximation of someUnaryFLOAToperation at line 65. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] signed char var_1_2 = -64; [L24] signed char var_1_3 = -1; [L25] signed long int var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] signed long int var_1_6 = 4; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] unsigned long int var_1_9 = 10; [L31] float var_1_10 = 99.5; [L32] float var_1_11 = 5.6; [L33] float var_1_12 = 255.5; [L34] float var_1_13 = 31.25; [L35] signed short int var_1_14 = 32; [L36] unsigned long int var_1_15 = 16; [L37] unsigned char var_1_16 = 1; [L38] unsigned char var_1_17 = 5; [L39] unsigned char var_1_18 = 50; [L40] unsigned char var_1_19 = 50; [L41] signed char var_1_20 = 1; [L42] signed char var_1_21 = -10; [L43] float var_1_22 = 0.5; [L44] signed char var_1_23 = 100; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L92] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L93] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L93] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L94] var_1_3 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L95] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L96] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L96] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L97] var_1_4 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L98] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L99] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L99] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=4, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L100] var_1_5 = __VERIFIER_nondet_long() [L101] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L101] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L102] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L102] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=4, var_1_7=1, var_1_8=0, var_1_9=10] [L103] var_1_6 = __VERIFIER_nondet_long() [L104] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L104] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L105] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L105] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L106] var_1_7 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_8=0, var_1_9=10] [L107] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_8=0, var_1_9=10] [L108] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L108] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=0, var_1_9=10] [L109] var_1_8 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L110] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L111] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L111] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L112] var_1_11 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L113] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L114] var_1_12 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L115] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L116] var_1_13 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L117] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L118] var_1_15 = __VERIFIER_nondet_ulong() [L119] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L119] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L120] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L120] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L121] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L121] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L122] var_1_17 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L123] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L124] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L124] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L125] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L125] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L126] var_1_18 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L127] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L128] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L128] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L129] var_1_19 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L130] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L131] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L131] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L132] var_1_21 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L133] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L134] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L134] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L147] RET updateVariables() [L148] CALL step() [L48] signed long int stepLocal_1 = var_1_2 * var_1_3; [L49] unsigned char stepLocal_0 = var_1_7; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=0, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L50] COND FALSE !(stepLocal_1 == var_1_4) VAL [isInitial=1, stepLocal_0=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L55] signed long int stepLocal_3 = (((var_1_6) < (0)) ? (var_1_6) : (0)); [L56] unsigned char stepLocal_2 = var_1_3 != var_1_4; VAL [isInitial=1, stepLocal_0=1, stepLocal_2=0, stepLocal_3=0, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L57] COND FALSE !((var_1_1 || (var_1_6 <= var_1_2)) || stepLocal_2) VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L62] unsigned char stepLocal_5 = var_1_11 < var_1_12; [L63] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, stepLocal_4=1, stepLocal_5=1, var_1_10=199/2, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L64] COND TRUE (! var_1_1) || stepLocal_4 [L65] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L73] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L76] EXPR (var_1_9 / var_1_15) & var_1_6 VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L76] COND FALSE !(((var_1_9 / var_1_15) & var_1_6) >= var_1_4) [L79] var_1_14 = -128 VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=-128, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L82] EXPR 256u << var_1_2 VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=-128, var_1_15=11, var_1_16=1, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L82] unsigned long int stepLocal_6 = 256u << var_1_2; [L83] COND TRUE (((((var_1_15) > (var_1_9)) ? (var_1_15) : (var_1_9))) / var_1_17) <= stepLocal_6 [L84] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, stepLocal_0=1, stepLocal_3=0, stepLocal_5=1, var_1_10=2, var_1_13=0, var_1_14=-128, var_1_15=11, var_1_16=0, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-127, var_1_22=1/2, var_1_23=100, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L86] var_1_20 = var_1_21 [L87] var_1_22 = var_1_12 [L88] var_1_23 = var_1_21 [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR (((((var_1_2 * var_1_3) == var_1_4) ? (((var_1_4 > (var_1_5 - var_1_6)) && var_1_7) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) ? ((((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5)) ? (var_1_9 == ((unsigned long int) var_1_6)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_4 != var_1_6)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : ((((var_1_9 / var_1_15) & var_1_6) >= var_1_4) ? (var_1_14 == ((signed short int) var_1_3)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=11, var_1_16=0, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L139] EXPR ((((((var_1_2 * var_1_3) == var_1_4) ? (((var_1_4 > (var_1_5 - var_1_6)) && var_1_7) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) ? ((((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5)) ? (var_1_9 == ((unsigned long int) var_1_6)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_4 != var_1_6)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : ((((var_1_9 / var_1_15) & var_1_6) >= var_1_4) ? (var_1_14 == ((signed short int) var_1_3)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (var_1_9)) ? (var_1_15) : (var_1_9))) / var_1_17) <= (256u << var_1_2)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=11, var_1_16=0, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L139-L140] return (((((((((var_1_2 * var_1_3) == var_1_4) ? (((var_1_4 > (var_1_5 - var_1_6)) && var_1_7) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_6 <= var_1_2)) || (var_1_3 != var_1_4)) ? ((((((var_1_6) < (0)) ? (var_1_6) : (0))) <= (-5 + var_1_5)) ? (var_1_9 == ((unsigned long int) var_1_6)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_4 != var_1_6)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : ((((var_1_9 / var_1_15) & var_1_6) >= var_1_4) ? (var_1_14 == ((signed short int) var_1_3)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (var_1_9)) ? (var_1_15) : (var_1_9))) / var_1_17) <= (256u << var_1_2)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=11, var_1_16=0, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=-128, var_1_15=11, var_1_16=0, var_1_17=12, var_1_18=256, var_1_19=-256, var_1_1=0, var_1_20=-127, var_1_21=-127, var_1_22=3, var_1_23=-127, var_1_2=0, var_1_3=-1, var_1_4=-1, var_1_5=5, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 4, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 356 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 356 mSDsluCounter, 718 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 358 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 407 IncrementalHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 360 mSDtfsCounter, 407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 81 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1076 NumberOfCodeBlocks, 1076 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 533 ConstructedInterpolants, 1 QuantifiedInterpolants, 2715 SizeOfPredicates, 2 NumberOfNonLiveVariables, 406 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4872/4872 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-11 07:33:54,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1515ceb6f758670420bf03659579c75f101fb2f02c9a542a1591764efdb5eeab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:33:57,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:33:57,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:33:57,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:33:57,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:33:57,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:33:57,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:33:57,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:33:57,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:33:57,226 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:33:57,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:33:57,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:33:57,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:33:57,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:33:57,231 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:33:57,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:33:57,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:33:57,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:33:57,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:33:57,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:33:57,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:33:57,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:33:57,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:33:57,237 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:33:57,237 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:33:57,237 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:33:57,238 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:33:57,238 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:33:57,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:33:57,238 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:33:57,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:33:57,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:33:57,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:33:57,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:33:57,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:33:57,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:33:57,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:33:57,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:33:57,241 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:33:57,242 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:33:57,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:33:57,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:33:57,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:33:57,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:33:57,243 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:33:57,243 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-clean/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-clean/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 -> 1515ceb6f758670420bf03659579c75f101fb2f02c9a542a1591764efdb5eeab [2024-10-11 07:33:57,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:33:57,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:33:57,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:33:57,611 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:33:57,612 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:33:57,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i [2024-10-11 07:33:59,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:33:59,378 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:33:59,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-53.i [2024-10-11 07:33:59,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bbc13fd35/e549423f378f4f0585dfdf848ab8e8d4/FLAG1b686d9b0 [2024-10-11 07:33:59,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bbc13fd35/e549423f378f4f0585dfdf848ab8e8d4 [2024-10-11 07:33:59,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:33:59,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:33:59,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:33:59,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:33:59,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:33:59,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:33:59" (1/1) ... [2024-10-11 07:33:59,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b402a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:59, skipping insertion in model container [2024-10-11 07:33:59,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:33:59" (1/1) ... [2024-10-11 07:33:59,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:33:59,664 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_codestructure_steplocals_file-53.i[917,930] [2024-10-11 07:33:59,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:33:59,757 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:33:59,768 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_codestructure_steplocals_file-53.i[917,930] [2024-10-11 07:33:59,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:33:59,834 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:33:59,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:59 WrapperNode [2024-10-11 07:33:59,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:33:59,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:33:59,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:33:59,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:33:59,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:59" (1/1) ... [2024-10-11 07:33:59,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:59" (1/1) ... [2024-10-11 07:33:59,898 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-10-11 07:33:59,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:33:59,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:33:59,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:33:59,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:33:59,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:59" (1/1) ... [2024-10-11 07:33:59,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:59" (1/1) ... [2024-10-11 07:33:59,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:59" (1/1) ... [2024-10-11 07:33:59,941 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-11 07:33:59,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:59" (1/1) ... [2024-10-11 07:33:59,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:59" (1/1) ... [2024-10-11 07:33:59,950 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:59" (1/1) ... [2024-10-11 07:33:59,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:59" (1/1) ... [2024-10-11 07:33:59,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:59" (1/1) ... [2024-10-11 07:33:59,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:59" (1/1) ... [2024-10-11 07:33:59,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:33:59,972 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:33:59,972 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:33:59,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:33:59,973 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:59" (1/1) ... [2024-10-11 07:33:59,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:33:59,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:34:00,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:34:00,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:34:00,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:34:00,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:34:00,051 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:34:00,051 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:34:00,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:34:00,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:34:00,133 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:34:00,135 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:34:00,805 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 07:34:00,805 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:34:00,882 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:34:00,883 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:34:00,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:34:00 BoogieIcfgContainer [2024-10-11 07:34:00,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:34:00,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:34:00,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:34:00,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:34:00,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:33:59" (1/3) ... [2024-10-11 07:34:00,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420733c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:34:00, skipping insertion in model container [2024-10-11 07:34:00,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:33:59" (2/3) ... [2024-10-11 07:34:00,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@420733c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:34:00, skipping insertion in model container [2024-10-11 07:34:00,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:34:00" (3/3) ... [2024-10-11 07:34:00,896 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-53.i [2024-10-11 07:34:00,911 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:34:00,911 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:34:00,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:34:00,976 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;@271f7f4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:34:00,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:34:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 07:34:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 07:34:00,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:34:00,993 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:34:00,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:34:00,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:34:00,998 INFO L85 PathProgramCache]: Analyzing trace with hash -116768340, now seen corresponding path program 1 times [2024-10-11 07:34:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:34:01,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815323679] [2024-10-11 07:34:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:34:01,010 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-11 07:34:01,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:34:01,017 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 07:34:01,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:34:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:01,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 07:34:01,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:34:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 07:34:01,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:34:01,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:34:01,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815323679] [2024-10-11 07:34:01,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815323679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:34:01,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:34:01,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:34:01,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831816293] [2024-10-11 07:34:01,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:34:01,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:34:01,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:34:01,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:34:01,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:34:01,981 INFO L87 Difference]: Start difference. First operand has 69 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 07:34:02,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:34:02,265 INFO L93 Difference]: Finished difference Result 199 states and 377 transitions. [2024-10-11 07:34:02,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:34:02,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 173 [2024-10-11 07:34:02,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:34:02,277 INFO L225 Difference]: With dead ends: 199 [2024-10-11 07:34:02,277 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 07:34:02,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 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-11 07:34:02,284 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 16 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:34:02,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 189 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:34:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 07:34:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-10-11 07:34:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 68 states have internal predecessors, (84), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 07:34:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 200 transitions. [2024-10-11 07:34:02,353 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 200 transitions. Word has length 173 [2024-10-11 07:34:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:34:02,354 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 200 transitions. [2024-10-11 07:34:02,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 07:34:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 200 transitions. [2024-10-11 07:34:02,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-11 07:34:02,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:34:02,361 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:34:02,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:34:02,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 07:34:02,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:34:02,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:34:02,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1964963023, now seen corresponding path program 1 times [2024-10-11 07:34:02,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:34:02,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578607118] [2024-10-11 07:34:02,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:34:02,565 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-11 07:34:02,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:34:02,572 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 07:34:02,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:34:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:02,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 07:34:02,823 INFO L278 TraceCheckSpWp]: Computing forward predicates...