./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:19:22,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:19:22,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:19:22,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:19:22,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:19:22,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:19:22,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:19:22,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:19:22,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:19:22,503 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:19:22,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:19:22,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:19:22,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:19:22,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:19:22,508 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:19:22,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:19:22,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:19:22,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:19:22,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:19:22,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:19:22,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:19:22,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:19:22,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:19:22,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:19:22,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:19:22,511 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:19:22,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:19:22,511 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:19:22,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:19:22,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:19:22,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:19:22,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:19:22,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:19:22,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:19:22,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:19:22,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:19:22,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:19:22,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:19:22,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:19:22,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:19:22,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:19:22,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:19:22,516 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 [2024-11-09 01:19:22,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:19:22,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:19:22,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:19:22,834 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:19:22,835 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:19:22,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2024-11-09 01:19:24,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:19:24,537 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:19:24,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2024-11-09 01:19:24,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25b327746/bf860d5ccb6d42e199625b26acdf3457/FLAGdb073e0ce [2024-11-09 01:19:24,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25b327746/bf860d5ccb6d42e199625b26acdf3457 [2024-11-09 01:19:24,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:19:24,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:19:24,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:19:24,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:19:24,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:19:24,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:19:24" (1/1) ... [2024-11-09 01:19:24,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b6b9b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:24, skipping insertion in model container [2024-11-09 01:19:24,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:19:24" (1/1) ... [2024-11-09 01:19:24,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:19:24,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i[913,926] [2024-11-09 01:19:24,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:19:24,879 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:19:24,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i[913,926] [2024-11-09 01:19:24,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:19:24,936 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:19:24,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:24 WrapperNode [2024-11-09 01:19:24,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:19:24,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:19:24,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:19:24,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:19:24,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:24" (1/1) ... [2024-11-09 01:19:24,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:24" (1/1) ... [2024-11-09 01:19:24,995 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2024-11-09 01:19:24,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:19:24,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:19:24,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:19:24,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:19:25,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:24" (1/1) ... [2024-11-09 01:19:25,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:24" (1/1) ... [2024-11-09 01:19:25,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:24" (1/1) ... [2024-11-09 01:19:25,038 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 01:19:25,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:24" (1/1) ... [2024-11-09 01:19:25,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:24" (1/1) ... [2024-11-09 01:19:25,047 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:24" (1/1) ... [2024-11-09 01:19:25,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:24" (1/1) ... [2024-11-09 01:19:25,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:24" (1/1) ... [2024-11-09 01:19:25,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:24" (1/1) ... [2024-11-09 01:19:25,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:19:25,066 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:19:25,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:19:25,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:19:25,068 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:24" (1/1) ... [2024-11-09 01:19:25,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:19:25,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:19:25,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:19:25,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:19:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:19:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:19:25,161 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:19:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:19:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:19:25,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:19:25,260 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:19:25,262 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:19:25,522 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 01:19:25,524 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:19:25,542 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:19:25,544 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:19:25,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:19:25 BoogieIcfgContainer [2024-11-09 01:19:25,545 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:19:25,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:19:25,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:19:25,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:19:25,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:19:24" (1/3) ... [2024-11-09 01:19:25,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18af1d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:19:25, skipping insertion in model container [2024-11-09 01:19:25,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:24" (2/3) ... [2024-11-09 01:19:25,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18af1d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:19:25, skipping insertion in model container [2024-11-09 01:19:25,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:19:25" (3/3) ... [2024-11-09 01:19:25,556 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-34.i [2024-11-09 01:19:25,574 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:19:25,574 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:19:25,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:19:25,655 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;@53879cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:19:25,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:19:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 01:19:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:19:25,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:25,679 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:25,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:19:25,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:25,687 INFO L85 PathProgramCache]: Analyzing trace with hash -343706398, now seen corresponding path program 1 times [2024-11-09 01:19:25,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:19:25,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519572636] [2024-11-09 01:19:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:25,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:25,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:19:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:25,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:19:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:19:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:19:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:19:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:19:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:19:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:19:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:19:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 01:19:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:19:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 01:19:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:19:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:19:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:19:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 01:19:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:19:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 01:19:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:19:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:19:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 01:19:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 01:19:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-09 01:19:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 01:19:26,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:19:26,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519572636] [2024-11-09 01:19:26,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519572636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:26,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:26,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:19:26,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725014484] [2024-11-09 01:19:26,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:26,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:19:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:19:26,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:19:26,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:19:26,241 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 01:19:26,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:26,270 INFO L93 Difference]: Finished difference Result 115 states and 201 transitions. [2024-11-09 01:19:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:19:26,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 141 [2024-11-09 01:19:26,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:26,285 INFO L225 Difference]: With dead ends: 115 [2024-11-09 01:19:26,285 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 01:19:26,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:19:26,291 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:26,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:19:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 01:19:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-09 01:19:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 01:19:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2024-11-09 01:19:26,335 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 141 [2024-11-09 01:19:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:26,336 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2024-11-09 01:19:26,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 01:19:26,336 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2024-11-09 01:19:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:19:26,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:26,341 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:26,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:19:26,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:19:26,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:26,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2126183968, now seen corresponding path program 1 times [2024-11-09 01:19:26,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:19:26,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964868819] [2024-11-09 01:19:26,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:19:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:19:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:19:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:19:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:19:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:19:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:19:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:19:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:19:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 01:19:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:19:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 01:19:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:19:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:19:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:19:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 01:19:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:19:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 01:19:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:19:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 01:19:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 01:19:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 01:19:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-09 01:19:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 01:19:30,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:19:30,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964868819] [2024-11-09 01:19:30,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964868819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:30,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:30,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:19:30,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081000741] [2024-11-09 01:19:30,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:30,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:19:30,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:19:30,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:19:30,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:19:30,980 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 01:19:32,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:32,026 INFO L93 Difference]: Finished difference Result 139 states and 203 transitions. [2024-11-09 01:19:32,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:19:32,028 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 141 [2024-11-09 01:19:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:32,030 INFO L225 Difference]: With dead ends: 139 [2024-11-09 01:19:32,031 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 01:19:32,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:19:32,033 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 150 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:32,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 300 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:19:32,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 01:19:32,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2024-11-09 01:19:32,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 01:19:32,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2024-11-09 01:19:32,047 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 141 [2024-11-09 01:19:32,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:32,049 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2024-11-09 01:19:32,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 01:19:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2024-11-09 01:19:32,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:19:32,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:32,052 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:32,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:19:32,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:19:32,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:32,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1359436702, now seen corresponding path program 1 times [2024-11-09 01:19:32,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:19:32,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504807816] [2024-11-09 01:19:32,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:32,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:19:32,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:19:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:19:32,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:19:32,230 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:19:32,233 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:19:32,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:19:32,239 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 01:19:32,333 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:19:32,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:19:32 BoogieIcfgContainer [2024-11-09 01:19:32,339 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:19:32,340 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:19:32,340 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:19:32,340 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:19:32,341 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:19:25" (3/4) ... [2024-11-09 01:19:32,343 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:19:32,345 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:19:32,349 INFO L158 Benchmark]: Toolchain (without parser) took 7768.89ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 110.1MB in the beginning and 207.7MB in the end (delta: -97.6MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-11-09 01:19:32,349 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 109.1MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:19:32,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.42ms. Allocated memory is still 146.8MB. Free memory was 110.1MB in the beginning and 95.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:19:32,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.06ms. Allocated memory is still 146.8MB. Free memory was 95.4MB in the beginning and 92.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:19:32,353 INFO L158 Benchmark]: Boogie Preprocessor took 69.22ms. Allocated memory is still 146.8MB. Free memory was 92.7MB in the beginning and 90.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:19:32,354 INFO L158 Benchmark]: RCFGBuilder took 479.06ms. Allocated memory is still 146.8MB. Free memory was 90.0MB in the beginning and 73.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 01:19:32,355 INFO L158 Benchmark]: TraceAbstraction took 6792.24ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 72.4MB in the beginning and 207.7MB in the end (delta: -135.3MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2024-11-09 01:19:32,355 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 255.9MB. Free memory is still 207.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:19:32,356 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.90ms. Allocated memory is still 109.1MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.42ms. Allocated memory is still 146.8MB. Free memory was 110.1MB in the beginning and 95.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.06ms. Allocated memory is still 146.8MB. Free memory was 95.4MB in the beginning and 92.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.22ms. Allocated memory is still 146.8MB. Free memory was 92.7MB in the beginning and 90.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 479.06ms. Allocated memory is still 146.8MB. Free memory was 90.0MB in the beginning and 73.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6792.24ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 72.4MB in the beginning and 207.7MB in the end (delta: -135.3MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 255.9MB. Free memory is still 207.7MB. 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 someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 16.6; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 1; [L25] double var_1_4 = 10.6; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_7 = 1; [L28] unsigned char var_1_8 = 0; [L29] unsigned char var_1_9 = 0; [L30] signed char var_1_10 = 10; [L31] unsigned char var_1_11 = 100; [L32] unsigned char var_1_12 = 64; [L33] unsigned char var_1_13 = 100; [L34] signed char var_1_14 = -4; [L35] signed char var_1_15 = 32; [L36] signed char var_1_16 = 4; [L37] signed char var_1_17 = 64; [L38] unsigned char last_1_var_1_5 = 0; VAL [isInitial=0, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=1, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=1, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L67] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L68] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L69] var_1_3 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L70] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L72] var_1_4 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L73] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L74] var_1_7 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L75] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L77] var_1_8 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L86] var_1_12 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_12 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_12 >= 64) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L89] var_1_13 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L92] var_1_14 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L95] var_1_15 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_15 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_15 >= -63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L98] var_1_16 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L114] RET updateVariables() [L115] CALL step() [L42] COND FALSE !(\read(last_1_var_1_5)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L47] COND FALSE !(var_1_1 >= (- (var_1_4 * var_1_1))) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L50] COND TRUE var_1_3 || (256 >= (var_1_17 + 4)) [L51] var_1_5 = ((var_1_2 || var_1_3) || var_1_7) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L55] signed long int stepLocal_1 = (var_1_11 + var_1_12) - ((((var_1_13) < (1)) ? (var_1_13) : (1))); [L56] signed char stepLocal_0 = var_1_17; VAL [isInitial=1, last_1_var_1_5=0, stepLocal_0=64, stepLocal_1=126, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L57] COND FALSE !(-10 >= stepLocal_0) VAL [isInitial=1, last_1_var_1_5=0, stepLocal_1=126, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return (((last_1_var_1_5 ? (last_1_var_1_5 ? (var_1_1 == ((double) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) : 1) && ((var_1_3 || (256 >= (var_1_17 + 4))) ? (var_1_5 == ((unsigned char) ((var_1_2 || var_1_3) || var_1_7))) : (var_1_5 == ((unsigned char) (! (! (var_1_8 || var_1_9))))))) && ((-10 >= var_1_17) ? ((((var_1_11 + var_1_12) - ((((var_1_13) < (1)) ? (var_1_13) : (1)))) > (~ var_1_17)) ? (var_1_10 == ((signed char) (var_1_14 + var_1_15))) : (var_1_10 == ((signed char) var_1_16))) : 1)) && ((var_1_1 >= (- (var_1_4 * var_1_1))) ? (var_1_17 == ((signed char) var_1_15)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 150 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 385 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 225 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 240 IncrementalHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 160 mSDtfsCounter, 240 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 21 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 1138 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2024/2024 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:19:32,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:19:34,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:19:34,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:19:34,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:19:34,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:19:34,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:19:34,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:19:34,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:19:34,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:19:34,859 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:19:34,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:19:34,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:19:34,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:19:34,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:19:34,862 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:19:34,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:19:34,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:19:34,865 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:19:34,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:19:34,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:19:34,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:19:34,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:19:34,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:19:34,870 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:19:34,870 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:19:34,870 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:19:34,870 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:19:34,870 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:19:34,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:19:34,871 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:19:34,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:19:34,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:19:34,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:19:34,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:19:34,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:19:34,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:19:34,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:19:34,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:19:34,873 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:19:34,873 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:19:34,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:19:34,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:19:34,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:19:34,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:19:34,875 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 [2024-11-09 01:19:35,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:19:35,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:19:35,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:19:35,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:19:35,223 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:19:35,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2024-11-09 01:19:36,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:19:37,098 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:19:37,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2024-11-09 01:19:37,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bb6c5434/9833a0e939b449398763b4b2156a963d/FLAGaf990b8f4 [2024-11-09 01:19:37,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bb6c5434/9833a0e939b449398763b4b2156a963d [2024-11-09 01:19:37,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:19:37,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:19:37,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:19:37,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:19:37,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:19:37,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:19:37" (1/1) ... [2024-11-09 01:19:37,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508ef9e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:37, skipping insertion in model container [2024-11-09 01:19:37,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:19:37" (1/1) ... [2024-11-09 01:19:37,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:19:37,373 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i[913,926] [2024-11-09 01:19:37,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:19:37,456 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:19:37,470 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i[913,926] [2024-11-09 01:19:37,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:19:37,525 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:19:37,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:37 WrapperNode [2024-11-09 01:19:37,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:19:37,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:19:37,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:19:37,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:19:37,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:37" (1/1) ... [2024-11-09 01:19:37,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:37" (1/1) ... [2024-11-09 01:19:37,594 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-09 01:19:37,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:19:37,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:19:37,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:19:37,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:19:37,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:37" (1/1) ... [2024-11-09 01:19:37,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:37" (1/1) ... [2024-11-09 01:19:37,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:37" (1/1) ... [2024-11-09 01:19:37,632 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 01:19:37,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:37" (1/1) ... [2024-11-09 01:19:37,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:37" (1/1) ... [2024-11-09 01:19:37,646 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:37" (1/1) ... [2024-11-09 01:19:37,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:37" (1/1) ... [2024-11-09 01:19:37,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:37" (1/1) ... [2024-11-09 01:19:37,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:37" (1/1) ... [2024-11-09 01:19:37,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:19:37,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:19:37,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:19:37,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:19:37,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:37" (1/1) ... [2024-11-09 01:19:37,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:19:37,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:19:37,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:19:37,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:19:37,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:19:37,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:19:37,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:19:37,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:19:37,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:19:37,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:19:37,840 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:19:37,843 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:19:44,564 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 01:19:44,565 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:19:44,581 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:19:44,581 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:19:44,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:19:44 BoogieIcfgContainer [2024-11-09 01:19:44,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:19:44,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:19:44,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:19:44,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:19:44,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:19:37" (1/3) ... [2024-11-09 01:19:44,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acb6769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:19:44, skipping insertion in model container [2024-11-09 01:19:44,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:37" (2/3) ... [2024-11-09 01:19:44,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acb6769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:19:44, skipping insertion in model container [2024-11-09 01:19:44,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:19:44" (3/3) ... [2024-11-09 01:19:44,589 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-34.i [2024-11-09 01:19:44,603 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:19:44,604 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:19:44,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:19:44,669 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;@950c75d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:19:44,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:19:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 01:19:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:19:44,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:44,685 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:44,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:19:44,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:44,690 INFO L85 PathProgramCache]: Analyzing trace with hash -343706398, now seen corresponding path program 1 times [2024-11-09 01:19:44,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:19:44,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772829916] [2024-11-09 01:19:44,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:44,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:19:44,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:19:44,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:19:44,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:19:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:45,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:19:45,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:19:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2024-11-09 01:19:45,141 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:19:45,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:19:45,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772829916] [2024-11-09 01:19:45,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772829916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:45,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:45,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:19:45,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630815109] [2024-11-09 01:19:45,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:45,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:19:45,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:19:45,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:19:45,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:19:45,178 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 01:19:45,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:45,213 INFO L93 Difference]: Finished difference Result 115 states and 201 transitions. [2024-11-09 01:19:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:19:45,216 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 141 [2024-11-09 01:19:45,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:45,224 INFO L225 Difference]: With dead ends: 115 [2024-11-09 01:19:45,224 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 01:19:45,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:19:45,233 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:45,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:19:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 01:19:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-09 01:19:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 01:19:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2024-11-09 01:19:45,281 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 141 [2024-11-09 01:19:45,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:45,283 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2024-11-09 01:19:45,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 01:19:45,284 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2024-11-09 01:19:45,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:19:45,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:45,287 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:45,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:19:45,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:19:45,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:19:45,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:45,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2126183968, now seen corresponding path program 1 times [2024-11-09 01:19:45,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:19:45,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414918889] [2024-11-09 01:19:45,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:45,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:19:45,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:19:45,494 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:19:45,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:19:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:45,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:19:45,798 INFO L278 TraceCheckSpWp]: Computing forward predicates...