./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:05:14,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:05:14,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:05:14,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:05:14,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:05:14,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:05:14,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:05:14,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:05:14,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:05:14,228 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:05:14,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:05:14,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:05:14,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:05:14,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:05:14,230 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:05:14,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:05:14,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:05:14,231 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:05:14,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:05:14,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:05:14,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:05:14,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:05:14,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:05:14,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:05:14,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:05:14,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:05:14,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:05:14,233 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:05:14,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:05:14,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:05:14,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:05:14,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:05:14,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:05:14,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:05:14,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:05:14,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:05:14,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:05:14,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:05:14,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:05:14,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:05:14,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:05:14,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:05:14,238 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 [2024-10-11 13:05:14,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:05:14,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:05:14,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:05:14,447 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:05:14,447 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:05:14,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2024-10-11 13:05:15,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:05:15,791 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:05:15,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2024-10-11 13:05:15,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c3d7e0e21/b53d6b85b9794983be7b83e5f0854fd5/FLAGd1b95cc83 [2024-10-11 13:05:15,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c3d7e0e21/b53d6b85b9794983be7b83e5f0854fd5 [2024-10-11 13:05:15,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:05:15,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:05:15,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:05:15,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:05:15,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:05:15,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:05:15" (1/1) ... [2024-10-11 13:05:15,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff16359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:15, skipping insertion in model container [2024-10-11 13:05:15,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:05:15" (1/1) ... [2024-10-11 13:05:15,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:05:15,984 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i[913,926] [2024-10-11 13:05:16,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:05:16,087 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:05:16,095 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i[913,926] [2024-10-11 13:05:16,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:05:16,139 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:05:16,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:16 WrapperNode [2024-10-11 13:05:16,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:05:16,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:05:16,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:05:16,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:05:16,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:16" (1/1) ... [2024-10-11 13:05:16,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:16" (1/1) ... [2024-10-11 13:05:16,186 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2024-10-11 13:05:16,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:05:16,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:05:16,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:05:16,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:05:16,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:16" (1/1) ... [2024-10-11 13:05:16,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:16" (1/1) ... [2024-10-11 13:05:16,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:16" (1/1) ... [2024-10-11 13:05:16,214 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 13:05:16,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:16" (1/1) ... [2024-10-11 13:05:16,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:16" (1/1) ... [2024-10-11 13:05:16,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:16" (1/1) ... [2024-10-11 13:05:16,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:16" (1/1) ... [2024-10-11 13:05:16,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:16" (1/1) ... [2024-10-11 13:05:16,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:16" (1/1) ... [2024-10-11 13:05:16,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:05:16,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:05:16,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:05:16,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:05:16,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:16" (1/1) ... [2024-10-11 13:05:16,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:05:16,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:05:16,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:05:16,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:05:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:05:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:05:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:05:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:05:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:05:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:05:16,361 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:05:16,363 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:05:16,529 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 13:05:16,529 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:05:16,566 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:05:16,566 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:05:16,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:05:16 BoogieIcfgContainer [2024-10-11 13:05:16,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:05:16,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:05:16,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:05:16,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:05:16,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:05:15" (1/3) ... [2024-10-11 13:05:16,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3292617f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:05:16, skipping insertion in model container [2024-10-11 13:05:16,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:16" (2/3) ... [2024-10-11 13:05:16,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3292617f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:05:16, skipping insertion in model container [2024-10-11 13:05:16,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:05:16" (3/3) ... [2024-10-11 13:05:16,573 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-34.i [2024-10-11 13:05:16,585 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:05:16,585 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:05:16,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:05:16,630 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;@66527427, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:05:16,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:05:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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-10-11 13:05:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 13:05:16,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:05:16,646 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] [2024-10-11 13:05:16,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:05:16,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:05:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1272942802, now seen corresponding path program 1 times [2024-10-11 13:05:16,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:05:16,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082140294] [2024-10-11 13:05:16,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:05:16,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:05:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:05:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:05:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:05:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:05:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:05:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 13:05:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:05:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:05:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:05:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 13:05:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:05:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 13:05:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:05:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:05:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:05:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 13:05:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:05:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 13:05:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:05:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:05:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:05:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 13:05:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:05:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:05:16,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:05:16,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082140294] [2024-10-11 13:05:16,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082140294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:05:16,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:05:16,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:05:16,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393953100] [2024-10-11 13:05:16,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:05:16,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:05:16,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:05:16,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:05:16,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:05:16,988 INFO L87 Difference]: Start difference. First operand has 55 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-10-11 13:05:17,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:05:17,040 INFO L93 Difference]: Finished difference Result 107 states and 193 transitions. [2024-10-11 13:05:17,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:05:17,042 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 137 [2024-10-11 13:05:17,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:05:17,047 INFO L225 Difference]: With dead ends: 107 [2024-10-11 13:05:17,047 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 13:05:17,049 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-10-11 13:05:17,052 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:05:17,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:05:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 13:05:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-11 13:05:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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-10-11 13:05:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2024-10-11 13:05:17,086 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 137 [2024-10-11 13:05:17,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:05:17,086 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2024-10-11 13:05:17,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-10-11 13:05:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2024-10-11 13:05:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 13:05:17,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:05:17,090 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] [2024-10-11 13:05:17,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:05:17,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:05:17,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:05:17,091 INFO L85 PathProgramCache]: Analyzing trace with hash -447124460, now seen corresponding path program 1 times [2024-10-11 13:05:17,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:05:17,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201958599] [2024-10-11 13:05:17,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:05:17,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:05:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:05:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:05:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:05:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:05:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:05:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 13:05:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:05:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:05:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:05:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 13:05:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:05:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 13:05:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:05:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:05:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:05:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 13:05:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:05:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 13:05:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:05:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:05:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:05:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 13:05:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:05:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:05:21,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:05:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201958599] [2024-10-11 13:05:21,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201958599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:05:21,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:05:21,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:05:21,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435900968] [2024-10-11 13:05:21,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:05:21,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:05:21,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:05:21,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:05:21,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:05:21,380 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-10-11 13:05:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:05:21,637 INFO L93 Difference]: Finished difference Result 130 states and 194 transitions. [2024-10-11 13:05:21,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:05:21,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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 137 [2024-10-11 13:05:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:05:21,641 INFO L225 Difference]: With dead ends: 130 [2024-10-11 13:05:21,641 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 13:05:21,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:05:21,643 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 113 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:05:21,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 185 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:05:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 13:05:21,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2024-10-11 13:05:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 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-10-11 13:05:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2024-10-11 13:05:21,660 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 137 [2024-10-11 13:05:21,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:05:21,663 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2024-10-11 13:05:21,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-10-11 13:05:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2024-10-11 13:05:21,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 13:05:21,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:05:21,666 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] [2024-10-11 13:05:21,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:05:21,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:05:21,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:05:21,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1327882902, now seen corresponding path program 1 times [2024-10-11 13:05:21,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:05:21,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799924916] [2024-10-11 13:05:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:05:21,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:05:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:05:21,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:05:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:05:21,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:05:21,793 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:05:21,794 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:05:21,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:05:21,797 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 13:05:21,861 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:05:21,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:05:21 BoogieIcfgContainer [2024-10-11 13:05:21,866 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:05:21,867 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:05:21,867 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:05:21,867 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:05:21,868 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:05:16" (3/4) ... [2024-10-11 13:05:21,869 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:05:21,870 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:05:21,871 INFO L158 Benchmark]: Toolchain (without parser) took 6051.45ms. Allocated memory was 163.6MB in the beginning and 444.6MB in the end (delta: 281.0MB). Free memory was 95.1MB in the beginning and 181.7MB in the end (delta: -86.6MB). Peak memory consumption was 196.1MB. Max. memory is 16.1GB. [2024-10-11 13:05:21,872 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 113.2MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:05:21,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.03ms. Allocated memory is still 163.6MB. Free memory was 95.0MB in the beginning and 132.3MB in the end (delta: -37.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:05:21,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.93ms. Allocated memory is still 163.6MB. Free memory was 132.3MB in the beginning and 129.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:05:21,873 INFO L158 Benchmark]: Boogie Preprocessor took 46.89ms. Allocated memory is still 163.6MB. Free memory was 129.8MB in the beginning and 126.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:05:21,873 INFO L158 Benchmark]: RCFGBuilder took 332.37ms. Allocated memory is still 163.6MB. Free memory was 126.8MB in the beginning and 107.2MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 13:05:21,874 INFO L158 Benchmark]: TraceAbstraction took 5297.84ms. Allocated memory was 163.6MB in the beginning and 444.6MB in the end (delta: 281.0MB). Free memory was 106.8MB in the beginning and 182.7MB in the end (delta: -76.0MB). Peak memory consumption was 206.0MB. Max. memory is 16.1GB. [2024-10-11 13:05:21,874 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 444.6MB. Free memory was 182.7MB in the beginning and 181.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:05:21,878 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 113.2MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.03ms. Allocated memory is still 163.6MB. Free memory was 95.0MB in the beginning and 132.3MB in the end (delta: -37.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.93ms. Allocated memory is still 163.6MB. Free memory was 132.3MB in the beginning and 129.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.89ms. Allocated memory is still 163.6MB. Free memory was 129.8MB in the beginning and 126.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 332.37ms. Allocated memory is still 163.6MB. Free memory was 126.8MB in the beginning and 107.2MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5297.84ms. Allocated memory was 163.6MB in the beginning and 444.6MB in the end (delta: 281.0MB). Free memory was 106.8MB in the beginning and 182.7MB in the end (delta: -76.0MB). Peak memory consumption was 206.0MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 444.6MB. Free memory was 182.7MB in the beginning and 181.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 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; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] last_1_var_1_5 = var_1_5 [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=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] [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=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] [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=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] [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=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=1, 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=1, 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=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] [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=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] [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=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] [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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=127, 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_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=127, 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_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=127, 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_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=127, 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_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=127, 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_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=127, 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_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=127, 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_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=127, 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_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=127, 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_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=127, 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=1, 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=127, 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=1, 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=127, 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=1, 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=127, 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=1, 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=127, 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=1, 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=127, 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=1, 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=127, 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=1, 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=127, 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=1, 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=127, 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=1, 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=127, 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=1, 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=127, 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=1, 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=127, 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=1, 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=127, 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=1, 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=127, 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=1, 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=127, 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=1, 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=127, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=-127, var_1_17=64, var_1_1=83/5, var_1_2=1, 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=127, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=-127, var_1_17=64, var_1_1=83/5, var_1_2=1, 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=127, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=-127, var_1_17=64, var_1_1=83/5, var_1_2=1, 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=127, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=-127, var_1_17=64, var_1_1=83/5, var_1_2=1, 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=127, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=-127, var_1_17=64, var_1_1=83/5, var_1_2=1, 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=127, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=-127, var_1_17=64, var_1_1=83/5, var_1_2=1, 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=127, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=-127, var_1_17=64, var_1_1=83/5, var_1_2=1, 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=127, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=-127, var_1_17=64, var_1_1=83/5, var_1_2=1, 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=127, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=-127, var_1_17=64, var_1_1=83/5, var_1_2=1, 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=189, var_1_10=10, var_1_11=63, var_1_12=127, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=-127, var_1_17=64, var_1_1=83/5, var_1_2=1, 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=189, var_1_10=10, var_1_11=63, var_1_12=127, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=-127, var_1_17=64, var_1_1=83/5, var_1_2=1, 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) ; [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=127, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=-127, var_1_17=64, var_1_1=83/5, var_1_2=1, 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=127, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=-127, var_1_17=64, var_1_1=83/5, var_1_2=1, 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, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 263 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 159 IncrementalHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 148 mSDtfsCounter, 159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 19 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 1143 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-10-11 13:05:21,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:05:23,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:05:23,799 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:05:23,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:05:23,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:05:23,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:05:23,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:05:23,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:05:23,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:05:23,822 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:05:23,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:05:23,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:05:23,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:05:23,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:05:23,824 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:05:23,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:05:23,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:05:23,824 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:05:23,825 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:05:23,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:05:23,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:05:23,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:05:23,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:05:23,826 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:05:23,826 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:05:23,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:05:23,827 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:05:23,827 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:05:23,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:05:23,827 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:05:23,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:05:23,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:05:23,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:05:23,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:05:23,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:05:23,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:05:23,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:05:23,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:05:23,829 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:05:23,829 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:05:23,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:05:23,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:05:23,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:05:23,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:05:23,830 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:05:23,830 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 [2024-10-11 13:05:24,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:05:24,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:05:24,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:05:24,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:05:24,105 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:05:24,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2024-10-11 13:05:25,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:05:25,592 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:05:25,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2024-10-11 13:05:25,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a2e4b3b35/d14797ef0bfd4ce3bf318143af714e10/FLAGfea00ace2 [2024-10-11 13:05:25,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a2e4b3b35/d14797ef0bfd4ce3bf318143af714e10 [2024-10-11 13:05:25,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:05:25,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:05:25,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:05:25,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:05:25,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:05:25,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:05:25" (1/1) ... [2024-10-11 13:05:25,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de8c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:25, skipping insertion in model container [2024-10-11 13:05:25,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:05:25" (1/1) ... [2024-10-11 13:05:25,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:05:25,786 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i[913,926] [2024-10-11 13:05:25,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:05:25,849 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:05:25,861 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i[913,926] [2024-10-11 13:05:25,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:05:25,896 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:05:25,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:25 WrapperNode [2024-10-11 13:05:25,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:05:25,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:05:25,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:05:25,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:05:25,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:25" (1/1) ... [2024-10-11 13:05:25,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:25" (1/1) ... [2024-10-11 13:05:25,936 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-10-11 13:05:25,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:05:25,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:05:25,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:05:25,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:05:25,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:25" (1/1) ... [2024-10-11 13:05:25,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:25" (1/1) ... [2024-10-11 13:05:25,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:25" (1/1) ... [2024-10-11 13:05:25,961 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 13:05:25,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:25" (1/1) ... [2024-10-11 13:05:25,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:25" (1/1) ... [2024-10-11 13:05:25,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:25" (1/1) ... [2024-10-11 13:05:25,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:25" (1/1) ... [2024-10-11 13:05:25,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:25" (1/1) ... [2024-10-11 13:05:25,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:25" (1/1) ... [2024-10-11 13:05:25,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:05:25,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:05:25,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:05:25,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:05:25,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:25" (1/1) ... [2024-10-11 13:05:26,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:05:26,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:05:26,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:05:26,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:05:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:05:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:05:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:05:26,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:05:26,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:05:26,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:05:26,134 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:05:26,136 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:05:30,892 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 13:05:30,892 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:05:30,939 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:05:30,940 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:05:30,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:05:30 BoogieIcfgContainer [2024-10-11 13:05:30,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:05:30,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:05:30,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:05:30,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:05:30,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:05:25" (1/3) ... [2024-10-11 13:05:30,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c2580e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:05:30, skipping insertion in model container [2024-10-11 13:05:30,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:25" (2/3) ... [2024-10-11 13:05:30,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c2580e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:05:30, skipping insertion in model container [2024-10-11 13:05:30,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:05:30" (3/3) ... [2024-10-11 13:05:30,950 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-34.i [2024-10-11 13:05:30,963 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:05:30,963 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:05:31,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:05:31,018 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;@1fc5090d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:05:31,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:05:31,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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-10-11 13:05:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 13:05:31,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:05:31,030 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] [2024-10-11 13:05:31,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:05:31,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:05:31,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1272942802, now seen corresponding path program 1 times [2024-10-11 13:05:31,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:05:31,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791694324] [2024-10-11 13:05:31,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:05:31,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:05:31,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:05:31,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:05:31,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:05:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:31,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:05:31,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:05:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-10-11 13:05:31,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:05:31,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:05:31,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791694324] [2024-10-11 13:05:31,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791694324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:05:31,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:05:31,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:05:31,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754677312] [2024-10-11 13:05:31,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:05:31,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:05:31,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:05:31,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:05:31,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:05:31,371 INFO L87 Difference]: Start difference. First operand has 55 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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), 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-10-11 13:05:34,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:05:34,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:05:34,591 INFO L93 Difference]: Finished difference Result 107 states and 193 transitions. [2024-10-11 13:05:34,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:05:34,619 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), 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 137 [2024-10-11 13:05:34,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:05:34,626 INFO L225 Difference]: With dead ends: 107 [2024-10-11 13:05:34,626 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 13:05:34,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:05:34,632 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:05:34,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 13:05:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 13:05:34,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-11 13:05:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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-10-11 13:05:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 80 transitions. [2024-10-11 13:05:34,664 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 80 transitions. Word has length 137 [2024-10-11 13:05:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:05:34,664 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 80 transitions. [2024-10-11 13:05:34,664 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), 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-10-11 13:05:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2024-10-11 13:05:34,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 13:05:34,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:05:34,666 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] [2024-10-11 13:05:34,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:05:34,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:05:34,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:05:34,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:05:34,868 INFO L85 PathProgramCache]: Analyzing trace with hash -447124460, now seen corresponding path program 1 times [2024-10-11 13:05:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:05:34,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048617214] [2024-10-11 13:05:34,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:05:34,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:05:34,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:05:34,891 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:05:34,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:05:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:35,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:05:35,156 INFO L278 TraceCheckSpWp]: Computing forward predicates...