./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p03.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p03.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash f7a00abffb1476a0a9385c66cbd20320ef85b37eb0a9fea8a014633d72f397a0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:03:40,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:03:40,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 07:03:40,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:03:40,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:03:40,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:03:40,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:03:40,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:03:40,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:03:40,271 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:03:40,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:03:40,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:03:40,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:03:40,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:03:40,275 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:03:40,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:03:40,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:03:40,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:03:40,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:03:40,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:03:40,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:03:40,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:03:40,282 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:03:40,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:03:40,282 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:03:40,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:03:40,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:03:40,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:03:40,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:03:40,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:40,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:03:40,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:03:40,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:03:40,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:03:40,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:03:40,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:03:40,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:03:40,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:03:40,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:03:40,286 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7a00abffb1476a0a9385c66cbd20320ef85b37eb0a9fea8a014633d72f397a0 [2024-10-11 07:03:40,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:03:40,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:03:40,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:03:40,586 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:03:40,587 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:03:40,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p03.c [2024-10-11 07:03:42,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:03:42,323 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:03:42,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p03.c [2024-10-11 07:03:42,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a92eb787b/a5509a1184144b968e7a0f8013c92bbf/FLAG39b2e8592 [2024-10-11 07:03:42,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a92eb787b/a5509a1184144b968e7a0f8013c92bbf [2024-10-11 07:03:42,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:03:42,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:03:42,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:42,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:03:42,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:03:42,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:42" (1/1) ... [2024-10-11 07:03:42,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7115c8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:42, skipping insertion in model container [2024-10-11 07:03:42,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:42" (1/1) ... [2024-10-11 07:03:42,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:03:42,936 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p03.c[1259,1272] [2024-10-11 07:03:43,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:43,233 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:03:43,243 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p03.c[1259,1272] [2024-10-11 07:03:43,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:43,350 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:03:43,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:43 WrapperNode [2024-10-11 07:03:43,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:43,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:43,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:03:43,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:03:43,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:43" (1/1) ... [2024-10-11 07:03:43,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:43" (1/1) ... [2024-10-11 07:03:43,597 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2099 [2024-10-11 07:03:43,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:43,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:03:43,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:03:43,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:03:43,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:43" (1/1) ... [2024-10-11 07:03:43,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:43" (1/1) ... [2024-10-11 07:03:43,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:43" (1/1) ... [2024-10-11 07:03:43,819 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:03:43,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:43" (1/1) ... [2024-10-11 07:03:43,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:43" (1/1) ... [2024-10-11 07:03:43,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:43" (1/1) ... [2024-10-11 07:03:43,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:43" (1/1) ... [2024-10-11 07:03:43,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:43" (1/1) ... [2024-10-11 07:03:43,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:43" (1/1) ... [2024-10-11 07:03:44,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:03:44,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:03:44,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:03:44,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:03:44,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:43" (1/1) ... [2024-10-11 07:03:44,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:44,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:03:44,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:03:44,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:03:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:03:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:03:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:03:44,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:03:44,411 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:03:44,413 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:03:46,453 INFO L? ?]: Removed 1319 outVars from TransFormulas that were not future-live. [2024-10-11 07:03:46,453 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:03:46,526 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:03:46,526 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:03:46,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:46 BoogieIcfgContainer [2024-10-11 07:03:46,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:03:46,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:03:46,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:03:46,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:03:46,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:03:42" (1/3) ... [2024-10-11 07:03:46,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f509b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:46, skipping insertion in model container [2024-10-11 07:03:46,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:43" (2/3) ... [2024-10-11 07:03:46,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f509b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:46, skipping insertion in model container [2024-10-11 07:03:46,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:46" (3/3) ... [2024-10-11 07:03:46,535 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p03.c [2024-10-11 07:03:46,552 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:03:46,552 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:03:46,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:03:46,653 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;@449387d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:03:46,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:03:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 520 states, 518 states have (on average 1.501930501930502) internal successors, (778), 519 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 07:03:46,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:46,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:46,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:46,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:46,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1551384783, now seen corresponding path program 1 times [2024-10-11 07:03:46,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:46,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496272423] [2024-10-11 07:03:46,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:46,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:47,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:47,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496272423] [2024-10-11 07:03:47,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496272423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:47,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:47,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:47,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577352622] [2024-10-11 07:03:47,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:47,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:03:47,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:47,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:03:47,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:47,542 INFO L87 Difference]: Start difference. First operand has 520 states, 518 states have (on average 1.501930501930502) internal successors, (778), 519 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:47,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:47,642 INFO L93 Difference]: Finished difference Result 988 states and 1480 transitions. [2024-10-11 07:03:47,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:03:47,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-11 07:03:47,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:47,659 INFO L225 Difference]: With dead ends: 988 [2024-10-11 07:03:47,659 INFO L226 Difference]: Without dead ends: 521 [2024-10-11 07:03:47,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:47,666 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 0 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:47,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2314 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:03:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-10-11 07:03:47,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2024-10-11 07:03:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.4961538461538462) internal successors, (778), 520 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 778 transitions. [2024-10-11 07:03:47,743 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 778 transitions. Word has length 36 [2024-10-11 07:03:47,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:47,744 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 778 transitions. [2024-10-11 07:03:47,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:47,745 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 778 transitions. [2024-10-11 07:03:47,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 07:03:47,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:47,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:47,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:03:47,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:47,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:47,748 INFO L85 PathProgramCache]: Analyzing trace with hash -846592656, now seen corresponding path program 1 times [2024-10-11 07:03:47,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:47,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051175715] [2024-10-11 07:03:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:47,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:47,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:47,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051175715] [2024-10-11 07:03:47,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051175715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:47,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:47,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:47,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812413380] [2024-10-11 07:03:47,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:47,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:03:47,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:47,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:03:47,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:47,912 INFO L87 Difference]: Start difference. First operand 521 states and 778 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:47,952 INFO L93 Difference]: Finished difference Result 991 states and 1480 transitions. [2024-10-11 07:03:47,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:03:47,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-11 07:03:47,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:47,957 INFO L225 Difference]: With dead ends: 991 [2024-10-11 07:03:47,957 INFO L226 Difference]: Without dead ends: 523 [2024-10-11 07:03:47,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:47,960 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 0 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2311 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:47,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2311 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:03:47,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-10-11 07:03:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2024-10-11 07:03:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 522 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 780 transitions. [2024-10-11 07:03:47,985 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 780 transitions. Word has length 37 [2024-10-11 07:03:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:47,987 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 780 transitions. [2024-10-11 07:03:47,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 780 transitions. [2024-10-11 07:03:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 07:03:47,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:47,990 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:47,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:03:47,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:47,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:47,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1572534294, now seen corresponding path program 1 times [2024-10-11 07:03:47,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:47,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825077841] [2024-10-11 07:03:47,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:48,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:48,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825077841] [2024-10-11 07:03:48,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825077841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:48,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:48,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:48,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931443753] [2024-10-11 07:03:48,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:48,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:03:48,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:48,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:03:48,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:03:48,432 INFO L87 Difference]: Start difference. First operand 523 states and 780 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:48,486 INFO L93 Difference]: Finished difference Result 991 states and 1479 transitions. [2024-10-11 07:03:48,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:03:48,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-11 07:03:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:48,489 INFO L225 Difference]: With dead ends: 991 [2024-10-11 07:03:48,490 INFO L226 Difference]: Without dead ends: 521 [2024-10-11 07:03:48,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:03:48,495 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 748 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:48,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1533 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:03:48,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-10-11 07:03:48,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2024-10-11 07:03:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.4923076923076923) internal successors, (776), 520 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 776 transitions. [2024-10-11 07:03:48,510 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 776 transitions. Word has length 38 [2024-10-11 07:03:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:48,511 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 776 transitions. [2024-10-11 07:03:48,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 776 transitions. [2024-10-11 07:03:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 07:03:48,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:48,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:48,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:03:48,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:48,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash 60622451, now seen corresponding path program 1 times [2024-10-11 07:03:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:48,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077949878] [2024-10-11 07:03:48,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:48,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:03:48,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:03:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:03:48,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:03:48,700 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:03:48,701 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:03:48,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:03:48,705 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 07:03:48,759 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:03:48,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:03:48 BoogieIcfgContainer [2024-10-11 07:03:48,765 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:03:48,765 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:03:48,765 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:03:48,766 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:03:48,766 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:46" (3/4) ... [2024-10-11 07:03:48,768 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:03:48,769 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:03:48,770 INFO L158 Benchmark]: Toolchain (without parser) took 6127.06ms. Allocated memory was 165.7MB in the beginning and 375.4MB in the end (delta: 209.7MB). Free memory was 96.1MB in the beginning and 199.5MB in the end (delta: -103.3MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. [2024-10-11 07:03:48,770 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 104.9MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:03:48,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 706.21ms. Allocated memory is still 165.7MB. Free memory was 96.0MB in the beginning and 105.7MB in the end (delta: -9.8MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-10-11 07:03:48,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 245.69ms. Allocated memory is still 165.7MB. Free memory was 105.7MB in the beginning and 57.5MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-11 07:03:48,773 INFO L158 Benchmark]: Boogie Preprocessor took 469.31ms. Allocated memory is still 165.7MB. Free memory was 57.5MB in the beginning and 102.7MB in the end (delta: -45.2MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2024-10-11 07:03:48,774 INFO L158 Benchmark]: RCFGBuilder took 2458.51ms. Allocated memory was 165.7MB in the beginning and 297.8MB in the end (delta: 132.1MB). Free memory was 102.7MB in the beginning and 139.7MB in the end (delta: -37.0MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. [2024-10-11 07:03:48,774 INFO L158 Benchmark]: TraceAbstraction took 2235.40ms. Allocated memory was 297.8MB in the beginning and 375.4MB in the end (delta: 77.6MB). Free memory was 138.6MB in the beginning and 200.5MB in the end (delta: -61.9MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-10-11 07:03:48,774 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 375.4MB. Free memory was 200.5MB in the beginning and 199.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:03:48,776 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.21ms. Allocated memory is still 104.9MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 706.21ms. Allocated memory is still 165.7MB. Free memory was 96.0MB in the beginning and 105.7MB in the end (delta: -9.8MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 245.69ms. Allocated memory is still 165.7MB. Free memory was 105.7MB in the beginning and 57.5MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 469.31ms. Allocated memory is still 165.7MB. Free memory was 57.5MB in the beginning and 102.7MB in the end (delta: -45.2MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2458.51ms. Allocated memory was 165.7MB in the beginning and 297.8MB in the end (delta: 132.1MB). Free memory was 102.7MB in the beginning and 139.7MB in the end (delta: -37.0MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2235.40ms. Allocated memory was 297.8MB in the beginning and 375.4MB in the end (delta: 77.6MB). Free memory was 138.6MB in the beginning and 200.5MB in the end (delta: -61.9MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 375.4MB. Free memory was 200.5MB in the beginning and 199.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: 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 bitwiseAnd at line 166. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_44 mask_SORT_44 = (SORT_44)-1 >> (sizeof(SORT_44) * 8 - 3); [L36] const SORT_44 msb_SORT_44 = (SORT_44)1 << (3 - 1); [L38] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 2); [L39] const SORT_71 msb_SORT_71 = (SORT_71)1 << (2 - 1); [L41] const SORT_73 mask_SORT_73 = (SORT_73)-1 >> (sizeof(SORT_73) * 8 - 32); [L42] const SORT_73 msb_SORT_73 = (SORT_73)1 << (32 - 1); [L44] const SORT_179 mask_SORT_179 = (SORT_179)-1 >> (sizeof(SORT_179) * 8 - 4); [L45] const SORT_179 msb_SORT_179 = (SORT_179)1 << (4 - 1); [L47] const SORT_3 var_7 = 0; [L48] const SORT_1 var_12 = 0; [L49] const SORT_1 var_23 = 1; [L50] const SORT_5 var_35 = 0; [L51] const SORT_44 var_45 = 0; [L52] const SORT_44 var_49 = 2; [L53] const SORT_44 var_53 = 1; [L54] const SORT_44 var_58 = 4; [L55] const SORT_44 var_60 = 5; [L56] const SORT_44 var_64 = 3; [L57] const SORT_73 var_75 = 0; [L58] const SORT_3 var_82 = 31; [L59] const SORT_44 var_272 = 7; [L60] const SORT_44 var_277 = 6; [L61] const SORT_3 var_330 = 2; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_68; [L67] SORT_3 input_69; [L68] SORT_3 input_70; [L69] SORT_3 input_81; [L70] SORT_3 input_91; [L71] SORT_3 input_92; [L72] SORT_3 input_93; [L73] SORT_3 input_96; [L74] SORT_3 input_115; [L75] SORT_3 input_116; [L76] SORT_3 input_117; [L77] SORT_3 input_120; [L78] SORT_3 input_122; [L79] SORT_71 input_136; [L80] SORT_71 input_137; [L81] SORT_71 input_138; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_5=4095, mask_SORT_71=3, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_35=0, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L83] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_5=4095, mask_SORT_71=3, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_35=0, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L84] SORT_3 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_5=4095, mask_SORT_71=3, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_35=0, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L85] SORT_3 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_5=4095, mask_SORT_71=3, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_35=0, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L86] SORT_3 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_5=4095, mask_SORT_71=3, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_35=0, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L87] SORT_3 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_5=4095, mask_SORT_71=3, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_35=0, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L88] SORT_3 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_5=4095, mask_SORT_71=3, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_35=0, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L89] SORT_3 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_5=4095, mask_SORT_71=3, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_35=0, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L90] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_71=3, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_35=0, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L91] SORT_5 state_36 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_71=3, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_35=0, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L92] SORT_3 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_71=3, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_35=0, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L93] SORT_3 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_71=3, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_35=0, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L94] SORT_3 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_44 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_71=3, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_35=0, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L95] SORT_44 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_44; [L97] SORT_3 init_9_arg_1 = var_7; [L98] state_8 = init_9_arg_1 [L99] SORT_3 init_11_arg_1 = var_7; [L100] state_10 = init_11_arg_1 [L101] SORT_3 init_15_arg_1 = var_7; [L102] state_14 = init_15_arg_1 [L103] SORT_3 init_17_arg_1 = var_7; [L104] state_16 = init_17_arg_1 [L105] SORT_3 init_28_arg_1 = var_7; [L106] state_27 = init_28_arg_1 [L107] SORT_3 init_30_arg_1 = var_7; [L108] state_29 = init_30_arg_1 [L109] SORT_3 init_32_arg_1 = var_7; [L110] state_31 = init_32_arg_1 [L111] SORT_1 init_34_arg_1 = var_12; [L112] state_33 = init_34_arg_1 [L113] SORT_5 init_37_arg_1 = var_35; [L114] state_36 = init_37_arg_1 [L115] SORT_3 init_39_arg_1 = var_7; [L116] state_38 = init_39_arg_1 [L117] SORT_3 init_41_arg_1 = var_7; [L118] state_40 = init_41_arg_1 [L119] SORT_3 init_43_arg_1 = var_7; [L120] state_42 = init_43_arg_1 [L121] SORT_44 init_47_arg_1 = var_45; [L122] state_46 = init_47_arg_1 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_71=3, state_10=0, state_14=0, state_16=0, state_27=0, state_29=0, state_31=0, state_33=0, state_36=0, state_38=0, state_40=0, state_42=0, state_46=0, state_8=0, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_68 = __VERIFIER_nondet_uchar() [L129] input_69 = __VERIFIER_nondet_uchar() [L130] input_70 = __VERIFIER_nondet_uchar() [L131] input_81 = __VERIFIER_nondet_uchar() [L132] input_91 = __VERIFIER_nondet_uchar() [L133] input_92 = __VERIFIER_nondet_uchar() [L134] input_93 = __VERIFIER_nondet_uchar() [L135] input_96 = __VERIFIER_nondet_uchar() [L136] input_115 = __VERIFIER_nondet_uchar() [L137] input_116 = __VERIFIER_nondet_uchar() [L138] input_117 = __VERIFIER_nondet_uchar() [L139] input_120 = __VERIFIER_nondet_uchar() [L140] input_122 = __VERIFIER_nondet_uchar() [L141] input_136 = __VERIFIER_nondet_uchar() [L142] input_137 = __VERIFIER_nondet_uchar() [L143] input_138 = __VERIFIER_nondet_uchar() [L146] SORT_1 var_18_arg_0 = var_12; [L147] SORT_3 var_18_arg_1 = state_16; [L148] SORT_3 var_18_arg_2 = state_14; [L149] SORT_3 var_18 = var_18_arg_0 ? var_18_arg_1 : var_18_arg_2; [L150] SORT_1 var_13_arg_0 = var_12; [L151] SORT_3 var_13_arg_1 = state_10; [L152] SORT_3 var_13_arg_2 = state_8; [L153] SORT_3 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L154] SORT_1 var_19_arg_0 = var_12; [L155] SORT_3 var_19_arg_1 = var_18; [L156] SORT_3 var_19_arg_2 = var_13; [L157] SORT_3 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_71=3, state_10=0, state_14=0, state_16=0, state_27=0, state_29=0, state_31=0, state_33=0, state_36=0, state_38=0, state_40=0, state_42=0, state_46=0, state_8=0, var_12=0, var_19=0, var_23=1, var_272=7, var_277=6, var_330=2, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L158] EXPR var_19 & mask_SORT_3 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_71=3, state_10=0, state_14=0, state_16=0, state_27=0, state_29=0, state_31=0, state_33=0, state_36=0, state_38=0, state_40=0, state_42=0, state_46=0, state_8=0, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L158] var_19 = var_19 & mask_SORT_3 [L159] SORT_3 var_20_arg_0 = var_19; [L160] SORT_3 var_20_arg_1 = var_7; [L161] SORT_1 var_20 = var_20_arg_0 == var_20_arg_1; [L162] SORT_1 var_24_arg_0 = var_20; [L163] SORT_1 var_24 = ~var_24_arg_0; [L164] SORT_1 var_25_arg_0 = var_23; [L165] SORT_1 var_25_arg_1 = var_24; VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_71=3, state_10=0, state_14=0, state_16=0, state_27=0, state_29=0, state_31=0, state_33=0, state_36=0, state_38=0, state_40=0, state_42=0, state_46=0, state_8=0, var_12=0, var_23=1, var_25_arg_0=1, var_25_arg_1=-2, var_272=7, var_277=6, var_330=2, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L166] EXPR var_25_arg_0 & var_25_arg_1 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_71=3, state_10=0, state_14=0, state_16=0, state_27=0, state_29=0, state_31=0, state_33=0, state_36=0, state_38=0, state_40=0, state_42=0, state_46=0, state_8=0, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L166] SORT_1 var_25 = var_25_arg_0 & var_25_arg_1; [L167] EXPR var_25 & mask_SORT_1 VAL [mask_SORT_179=15, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_44=7, mask_SORT_71=3, state_10=0, state_14=0, state_16=0, state_27=0, state_29=0, state_31=0, state_33=0, state_36=0, state_38=0, state_40=0, state_42=0, state_46=0, state_8=0, var_12=0, var_23=1, var_272=7, var_277=6, var_330=2, var_45=0, var_49=2, var_53=1, var_58=4, var_60=5, var_64=3, var_75=0, var_7=0, var_82=31] [L167] var_25 = var_25 & mask_SORT_1 [L168] SORT_1 bad_26_arg_0 = var_25; [L169] CALL __VERIFIER_assert(!(bad_26_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 520 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 748 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 748 mSDsluCounter, 6158 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3845 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 2313 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=523occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 209 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 07:03:48,807 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p03.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash f7a00abffb1476a0a9385c66cbd20320ef85b37eb0a9fea8a014633d72f397a0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:03:51,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:03:51,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 07:03:51,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:03:51,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:03:51,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:03:51,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:03:51,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:03:51,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:03:51,225 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:03:51,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:03:51,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:03:51,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:03:51,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:03:51,227 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:03:51,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:03:51,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:03:51,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:03:51,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:03:51,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:03:51,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:03:51,232 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:03:51,232 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:03:51,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:03:51,233 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:03:51,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:03:51,233 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:03:51,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:03:51,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:03:51,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:03:51,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:03:51,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:51,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:03:51,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:03:51,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:03:51,237 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:03:51,237 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:03:51,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:03:51,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:03:51,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:03:51,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:03:51,241 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:03:51,241 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7a00abffb1476a0a9385c66cbd20320ef85b37eb0a9fea8a014633d72f397a0 [2024-10-11 07:03:51,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:03:51,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:03:51,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:03:51,610 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:03:51,611 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:03:51,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p03.c [2024-10-11 07:03:53,217 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:03:53,484 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:03:53,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p03.c [2024-10-11 07:03:53,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9c89a524f/b1feca8a36004041bd4b83c29f829555/FLAGc0d9a5d8e [2024-10-11 07:03:53,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9c89a524f/b1feca8a36004041bd4b83c29f829555 [2024-10-11 07:03:53,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:03:53,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:03:53,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:53,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:03:53,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:03:53,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:53" (1/1) ... [2024-10-11 07:03:53,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f60de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:53, skipping insertion in model container [2024-10-11 07:03:53,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:53" (1/1) ... [2024-10-11 07:03:53,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:03:54,118 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p03.c[1259,1272] [2024-10-11 07:03:54,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:54,365 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:03:54,380 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p03.c[1259,1272] [2024-10-11 07:03:54,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:54,541 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:03:54,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:54 WrapperNode [2024-10-11 07:03:54,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:54,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:54,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:03:54,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:03:54,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:54" (1/1) ... [2024-10-11 07:03:54,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:54" (1/1) ... [2024-10-11 07:03:54,678 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1073 [2024-10-11 07:03:54,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:54,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:03:54,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:03:54,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:03:54,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:54" (1/1) ... [2024-10-11 07:03:54,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:54" (1/1) ... [2024-10-11 07:03:54,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:54" (1/1) ... [2024-10-11 07:03:54,747 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:03:54,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:54" (1/1) ... [2024-10-11 07:03:54,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:54" (1/1) ... [2024-10-11 07:03:54,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:54" (1/1) ... [2024-10-11 07:03:54,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:54" (1/1) ... [2024-10-11 07:03:54,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:54" (1/1) ... [2024-10-11 07:03:54,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:54" (1/1) ... [2024-10-11 07:03:54,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:03:54,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:03:54,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:03:54,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:03:54,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:54" (1/1) ... [2024-10-11 07:03:54,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:54,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:03:54,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:03:54,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:03:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:03:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:03:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:03:54,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:03:55,191 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:03:55,194 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:03:56,738 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-11 07:03:56,739 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:03:56,799 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:03:56,800 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:03:56,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:56 BoogieIcfgContainer [2024-10-11 07:03:56,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:03:56,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:03:56,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:03:56,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:03:56,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:03:53" (1/3) ... [2024-10-11 07:03:56,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54173d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:56, skipping insertion in model container [2024-10-11 07:03:56,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:54" (2/3) ... [2024-10-11 07:03:56,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54173d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:56, skipping insertion in model container [2024-10-11 07:03:56,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:56" (3/3) ... [2024-10-11 07:03:56,810 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p03.c [2024-10-11 07:03:56,827 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:03:56,827 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:03:56,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:03:56,894 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;@6ae48e5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:03:56,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:03:56,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 07:03:56,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:56,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 07:03:56,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:56,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:56,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 07:03:56,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:03:56,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920235070] [2024-10-11 07:03:56,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:56,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:03:56,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:03:56,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:03:56,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 07:03:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:57,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 07:03:57,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:03:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:57,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:03:57,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:03:57,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920235070] [2024-10-11 07:03:57,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920235070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:57,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:57,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:03:57,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013002945] [2024-10-11 07:03:57,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:57,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:03:57,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:03:57,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:03:57,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:57,430 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:57,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:57,531 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 07:03:57,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:03:57,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 07:03:57,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:57,542 INFO L225 Difference]: With dead ends: 15 [2024-10-11 07:03:57,542 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 07:03:57,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:03:57,548 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:57,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:03:57,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 07:03:57,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 07:03:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 07:03:57,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 07:03:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:57,598 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 07:03:57,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 07:03:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 07:03:57,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:57,598 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 07:03:57,610 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-11 07:03:57,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:03:57,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:57,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:57,807 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 07:03:57,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:03:57,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570737643] [2024-10-11 07:03:57,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:57,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:03:57,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:03:57,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:03:57,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 07:03:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:58,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 07:03:58,193 INFO L278 TraceCheckSpWp]: Computing forward predicates...