./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_p02.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_p02.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 c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:03:39,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:03:39,331 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:39,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:03:39,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:03:39,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:03:39,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:03:39,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:03:39,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:03:39,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:03:39,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:03:39,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:03:39,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:03:39,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:03:39,372 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:03:39,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:03:39,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:03:39,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:03:39,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:03:39,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:03:39,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:03:39,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:03:39,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:03:39,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:03:39,375 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:03:39,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:03:39,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:03:39,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:03:39,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:03:39,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:39,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:03:39,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:03:39,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:03:39,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:03:39,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:03:39,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:03:39,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:03:39,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:03:39,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:03:39,379 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 -> c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 [2024-10-11 07:03:39,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:03:39,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:03:39,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:03:39,684 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:03:39,684 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:03:39,686 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_p02.c [2024-10-11 07:03:41,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:03:41,397 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:03:41,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c [2024-10-11 07:03:41,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5205e1317/f34d6e2c569843a3a49d314392bf1e44/FLAGf96d6fb59 [2024-10-11 07:03:41,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5205e1317/f34d6e2c569843a3a49d314392bf1e44 [2024-10-11 07:03:41,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:03:41,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:03:41,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:41,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:03:41,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:03:41,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:41" (1/1) ... [2024-10-11 07:03:41,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bed852a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:41, skipping insertion in model container [2024-10-11 07:03:41,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:41" (1/1) ... [2024-10-11 07:03:41,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:03:41,733 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_p02.c[1259,1272] [2024-10-11 07:03:42,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:42,015 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:03:42,024 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_p02.c[1259,1272] [2024-10-11 07:03:42,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:42,212 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:03:42,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:42 WrapperNode [2024-10-11 07:03:42,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:42,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:42,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:03:42,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:03:42,231 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:42" (1/1) ... [2024-10-11 07:03:42,279 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:42" (1/1) ... [2024-10-11 07:03:42,520 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2114 [2024-10-11 07:03:42,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:42,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:03:42,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:03:42,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:03:42,533 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:42" (1/1) ... [2024-10-11 07:03:42,534 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:42" (1/1) ... [2024-10-11 07:03:42,590 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:42" (1/1) ... [2024-10-11 07:03:42,664 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:42,665 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:42" (1/1) ... [2024-10-11 07:03:42,665 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:42" (1/1) ... [2024-10-11 07:03:42,727 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:42" (1/1) ... [2024-10-11 07:03:42,749 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:42" (1/1) ... [2024-10-11 07:03:42,774 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:42" (1/1) ... [2024-10-11 07:03:42,790 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:42" (1/1) ... [2024-10-11 07:03:42,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:03:42,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:03:42,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:03:42,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:03:42,827 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:42" (1/1) ... [2024-10-11 07:03:42,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:42,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:03:42,860 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:42,863 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:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:03:42,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:03:42,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:03:42,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:03:43,219 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:03:43,221 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:03:45,534 INFO L? ?]: Removed 1324 outVars from TransFormulas that were not future-live. [2024-10-11 07:03:45,534 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:03:45,617 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:03:45,617 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:03:45,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:45 BoogieIcfgContainer [2024-10-11 07:03:45,618 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:03:45,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:03:45,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:03:45,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:03:45,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:03:41" (1/3) ... [2024-10-11 07:03:45,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce3428a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:45, skipping insertion in model container [2024-10-11 07:03:45,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:42" (2/3) ... [2024-10-11 07:03:45,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce3428a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:45, skipping insertion in model container [2024-10-11 07:03:45,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:45" (3/3) ... [2024-10-11 07:03:45,629 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c [2024-10-11 07:03:45,647 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:03:45,648 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:03:45,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:03:45,750 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;@10ee1152, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:03:45,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:03:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.5019011406844107) internal successors, (790), 527 states have internal predecessors, (790), 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:45,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 07:03:45,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:45,767 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, 1] [2024-10-11 07:03:45,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:45,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:45,773 INFO L85 PathProgramCache]: Analyzing trace with hash -399891957, now seen corresponding path program 1 times [2024-10-11 07:03:45,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:45,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735204570] [2024-10-11 07:03:45,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:45,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:46,480 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:46,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:46,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735204570] [2024-10-11 07:03:46,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735204570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:46,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:46,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:46,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897980643] [2024-10-11 07:03:46,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:46,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:03:46,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:46,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:03:46,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:46,522 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.5019011406844107) internal successors, (790), 527 states have internal predecessors, (790), 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 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:46,650 INFO L93 Difference]: Finished difference Result 1004 states and 1504 transitions. [2024-10-11 07:03:46,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:03:46,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2024-10-11 07:03:46,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:46,668 INFO L225 Difference]: With dead ends: 1004 [2024-10-11 07:03:46,668 INFO L226 Difference]: Without dead ends: 529 [2024-10-11 07:03:46,672 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:46,676 INFO L432 NwaCegarLoop]: 785 mSDtfsCounter, 0 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2350 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:46,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2350 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:46,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-10-11 07:03:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2024-10-11 07:03:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.496212121212121) internal successors, (790), 528 states have internal predecessors, (790), 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,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 790 transitions. [2024-10-11 07:03:46,739 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 790 transitions. Word has length 40 [2024-10-11 07:03:46,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:46,740 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 790 transitions. [2024-10-11 07:03:46,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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,740 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 790 transitions. [2024-10-11 07:03:46,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 07:03:46,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:46,742 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, 1, 1] [2024-10-11 07:03:46,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:03:46,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:46,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:46,743 INFO L85 PathProgramCache]: Analyzing trace with hash 489946608, now seen corresponding path program 1 times [2024-10-11 07:03:46,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:46,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533381951] [2024-10-11 07:03:46,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:46,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:46,948 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:46,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:46,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533381951] [2024-10-11 07:03:46,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533381951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:46,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:46,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:46,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376065107] [2024-10-11 07:03:46,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:46,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:03:46,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:46,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:03:46,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:46,953 INFO L87 Difference]: Start difference. First operand 529 states and 790 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:46,999 INFO L93 Difference]: Finished difference Result 1007 states and 1504 transitions. [2024-10-11 07:03:46,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:03:47,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2024-10-11 07:03:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:47,003 INFO L225 Difference]: With dead ends: 1007 [2024-10-11 07:03:47,003 INFO L226 Difference]: Without dead ends: 531 [2024-10-11 07:03:47,006 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,007 INFO L432 NwaCegarLoop]: 785 mSDtfsCounter, 0 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2347 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,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2347 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,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-10-11 07:03:47,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2024-10-11 07:03:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.4943396226415093) internal successors, (792), 530 states have internal predecessors, (792), 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,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 792 transitions. [2024-10-11 07:03:47,041 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 792 transitions. Word has length 41 [2024-10-11 07:03:47,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:47,041 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 792 transitions. [2024-10-11 07:03:47,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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,041 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 792 transitions. [2024-10-11 07:03:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 07:03:47,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:47,043 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, 1, 1, 1] [2024-10-11 07:03:47,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:03:47,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:47,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:47,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1205477252, now seen corresponding path program 1 times [2024-10-11 07:03:47,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:47,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090810021] [2024-10-11 07:03:47,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:47,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:47,391 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,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:47,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090810021] [2024-10-11 07:03:47,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090810021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:47,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:47,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:47,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635779482] [2024-10-11 07:03:47,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:47,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:03:47,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:47,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:03:47,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:03:47,398 INFO L87 Difference]: Start difference. First operand 531 states and 792 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:47,484 INFO L93 Difference]: Finished difference Result 1013 states and 1511 transitions. [2024-10-11 07:03:47,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:03:47,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2024-10-11 07:03:47,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:47,486 INFO L225 Difference]: With dead ends: 1013 [2024-10-11 07:03:47,487 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 07:03:47,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:03:47,491 INFO L432 NwaCegarLoop]: 781 mSDtfsCounter, 760 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 2337 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:47,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 2337 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:03:47,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 07:03:47,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 534. [2024-10-11 07:03:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.4915572232645404) internal successors, (795), 533 states have internal predecessors, (795), 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,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 795 transitions. [2024-10-11 07:03:47,509 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 795 transitions. Word has length 42 [2024-10-11 07:03:47,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:47,509 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 795 transitions. [2024-10-11 07:03:47,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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,510 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 795 transitions. [2024-10-11 07:03:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 07:03:47,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:47,513 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, 1, 1, 1, 1] [2024-10-11 07:03:47,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:03:47,513 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:47,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:47,514 INFO L85 PathProgramCache]: Analyzing trace with hash 279634483, now seen corresponding path program 1 times [2024-10-11 07:03:47,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:47,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462232784] [2024-10-11 07:03:47,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:47,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:48,144 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,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:48,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462232784] [2024-10-11 07:03:48,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462232784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:48,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:48,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:03:48,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175430070] [2024-10-11 07:03:48,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:48,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:03:48,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:48,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:03:48,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:03:48,146 INFO L87 Difference]: Start difference. First operand 534 states and 795 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:48,252 INFO L93 Difference]: Finished difference Result 1024 states and 1524 transitions. [2024-10-11 07:03:48,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:03:48,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2024-10-11 07:03:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:48,255 INFO L225 Difference]: With dead ends: 1024 [2024-10-11 07:03:48,255 INFO L226 Difference]: Without dead ends: 543 [2024-10-11 07:03:48,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:03:48,261 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 775 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:48,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 3100 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:03:48,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-10-11 07:03:48,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 538. [2024-10-11 07:03:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.48975791433892) internal successors, (800), 537 states have internal predecessors, (800), 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,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 800 transitions. [2024-10-11 07:03:48,275 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 800 transitions. Word has length 43 [2024-10-11 07:03:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:48,275 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 800 transitions. [2024-10-11 07:03:48,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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,276 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 800 transitions. [2024-10-11 07:03:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 07:03:48,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:48,277 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, 1, 1, 1, 1] [2024-10-11 07:03:48,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:03:48,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:48,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:48,278 INFO L85 PathProgramCache]: Analyzing trace with hash -376023817, now seen corresponding path program 1 times [2024-10-11 07:03:48,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:48,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109204099] [2024-10-11 07:03:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:48,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:48,601 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,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:48,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109204099] [2024-10-11 07:03:48,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109204099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:48,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:48,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:03:48,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551609835] [2024-10-11 07:03:48,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:48,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:03:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:48,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:03:48,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:03:48,608 INFO L87 Difference]: Start difference. First operand 538 states and 800 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 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,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:48,691 INFO L93 Difference]: Finished difference Result 1021 states and 1519 transitions. [2024-10-11 07:03:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:03:48,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 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 43 [2024-10-11 07:03:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:48,694 INFO L225 Difference]: With dead ends: 1021 [2024-10-11 07:03:48,694 INFO L226 Difference]: Without dead ends: 536 [2024-10-11 07:03:48,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:03:48,697 INFO L432 NwaCegarLoop]: 774 mSDtfsCounter, 754 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 3093 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:48,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 3093 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:03:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-10-11 07:03:48,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 533. [2024-10-11 07:03:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 1.4906015037593985) internal successors, (793), 532 states have internal predecessors, (793), 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,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 793 transitions. [2024-10-11 07:03:48,709 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 793 transitions. Word has length 43 [2024-10-11 07:03:48,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:48,709 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 793 transitions. [2024-10-11 07:03:48,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 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,710 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 793 transitions. [2024-10-11 07:03:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 07:03:48,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:48,713 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, 1, 1, 1, 1, 1] [2024-10-11 07:03:48,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:03:48,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:48,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:48,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1296952007, now seen corresponding path program 1 times [2024-10-11 07:03:48,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:48,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587119763] [2024-10-11 07:03:48,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:48,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:48,920 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,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:48,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587119763] [2024-10-11 07:03:48,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587119763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:48,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:48,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:48,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076255330] [2024-10-11 07:03:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:48,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:03:48,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:03:48,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:03:48,923 INFO L87 Difference]: Start difference. First operand 533 states and 793 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:49,481 INFO L93 Difference]: Finished difference Result 1107 states and 1642 transitions. [2024-10-11 07:03:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:03:49,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2024-10-11 07:03:49,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:49,485 INFO L225 Difference]: With dead ends: 1107 [2024-10-11 07:03:49,486 INFO L226 Difference]: Without dead ends: 627 [2024-10-11 07:03:49,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:03:49,490 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 1011 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:49,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 1777 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 07:03:49,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-10-11 07:03:49,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 541. [2024-10-11 07:03:49,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 1.487037037037037) internal successors, (803), 540 states have internal predecessors, (803), 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:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 803 transitions. [2024-10-11 07:03:49,506 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 803 transitions. Word has length 44 [2024-10-11 07:03:49,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:49,506 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 803 transitions. [2024-10-11 07:03:49,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 803 transitions. [2024-10-11 07:03:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 07:03:49,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:49,510 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, 1, 1, 1, 1, 1] [2024-10-11 07:03:49,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:03:49,510 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:49,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:49,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1502258400, now seen corresponding path program 1 times [2024-10-11 07:03:49,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:49,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281499860] [2024-10-11 07:03:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:49,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:03:49,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:03:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:03:49,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:03:49,655 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:03:49,656 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:03:49,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 07:03:49,665 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:49,732 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:03:49,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:03:49 BoogieIcfgContainer [2024-10-11 07:03:49,736 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:03:49,736 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:03:49,736 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:03:49,736 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:03:49,737 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:45" (3/4) ... [2024-10-11 07:03:49,739 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:03:49,741 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:03:49,742 INFO L158 Benchmark]: Toolchain (without parser) took 8285.28ms. Allocated memory was 176.2MB in the beginning and 461.4MB in the end (delta: 285.2MB). Free memory was 117.5MB in the beginning and 319.9MB in the end (delta: -202.4MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. [2024-10-11 07:03:49,742 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:03:49,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 759.89ms. Allocated memory was 176.2MB in the beginning and 266.3MB in the end (delta: 90.2MB). Free memory was 117.5MB in the beginning and 224.8MB in the end (delta: -107.3MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2024-10-11 07:03:49,742 INFO L158 Benchmark]: Boogie Procedure Inliner took 300.49ms. Allocated memory is still 266.3MB. Free memory was 224.8MB in the beginning and 175.5MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-10-11 07:03:49,743 INFO L158 Benchmark]: Boogie Preprocessor took 303.16ms. Allocated memory is still 266.3MB. Free memory was 175.5MB in the beginning and 147.2MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 07:03:49,743 INFO L158 Benchmark]: RCFGBuilder took 2793.21ms. Allocated memory was 266.3MB in the beginning and 461.4MB in the end (delta: 195.0MB). Free memory was 147.2MB in the beginning and 373.5MB in the end (delta: -226.3MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. [2024-10-11 07:03:49,743 INFO L158 Benchmark]: TraceAbstraction took 4114.35ms. Allocated memory is still 461.4MB. Free memory was 372.5MB in the beginning and 319.9MB in the end (delta: 52.5MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2024-10-11 07:03:49,744 INFO L158 Benchmark]: Witness Printer took 4.77ms. Allocated memory is still 461.4MB. Free memory is still 319.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:03:49,745 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 759.89ms. Allocated memory was 176.2MB in the beginning and 266.3MB in the end (delta: 90.2MB). Free memory was 117.5MB in the beginning and 224.8MB in the end (delta: -107.3MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 300.49ms. Allocated memory is still 266.3MB. Free memory was 224.8MB in the beginning and 175.5MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 303.16ms. Allocated memory is still 266.3MB. Free memory was 175.5MB in the beginning and 147.2MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2793.21ms. Allocated memory was 266.3MB in the beginning and 461.4MB in the end (delta: 195.0MB). Free memory was 147.2MB in the beginning and 373.5MB in the end (delta: -226.3MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4114.35ms. Allocated memory is still 461.4MB. Free memory was 372.5MB in the beginning and 319.9MB in the end (delta: 52.5MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. * Witness Printer took 4.77ms. Allocated memory is still 461.4MB. Free memory is still 319.9MB. 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 165. 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_45 mask_SORT_45 = (SORT_45)-1 >> (sizeof(SORT_45) * 8 - 3); [L36] const SORT_45 msb_SORT_45 = (SORT_45)1 << (3 - 1); [L38] const SORT_86 mask_SORT_86 = (SORT_86)-1 >> (sizeof(SORT_86) * 8 - 4); [L39] const SORT_86 msb_SORT_86 = (SORT_86)1 << (4 - 1); [L41] const SORT_143 mask_SORT_143 = (SORT_143)-1 >> (sizeof(SORT_143) * 8 - 32); [L42] const SORT_143 msb_SORT_143 = (SORT_143)1 << (32 - 1); [L44] const SORT_167 mask_SORT_167 = (SORT_167)-1 >> (sizeof(SORT_167) * 8 - 2); [L45] const SORT_167 msb_SORT_167 = (SORT_167)1 << (2 - 1); [L47] const SORT_3 var_7 = 0; [L48] const SORT_1 var_11 = 0; [L49] const SORT_1 var_20 = 1; [L50] const SORT_5 var_32 = 0; [L51] const SORT_45 var_46 = 0; [L52] const SORT_45 var_50 = 2; [L53] const SORT_45 var_54 = 1; [L54] const SORT_45 var_59 = 4; [L55] const SORT_45 var_61 = 5; [L56] const SORT_45 var_65 = 3; [L57] const SORT_3 var_73 = 2; [L58] const SORT_45 var_103 = 7; [L59] const SORT_45 var_108 = 6; [L60] const SORT_143 var_145 = 0; [L61] const SORT_3 var_176 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_164; [L67] SORT_3 input_165; [L68] SORT_3 input_166; [L69] SORT_3 input_175; [L70] SORT_3 input_185; [L71] SORT_3 input_186; [L72] SORT_3 input_187; [L73] SORT_3 input_190; [L74] SORT_3 input_209; [L75] SORT_3 input_210; [L76] SORT_3 input_211; [L77] SORT_3 input_214; [L78] SORT_3 input_216; [L79] SORT_167 input_230; [L80] SORT_167 input_231; [L81] SORT_167 input_232; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L83] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L84] SORT_3 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L85] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L86] SORT_3 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L87] SORT_3 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L88] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L89] SORT_5 state_33 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L90] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L91] SORT_3 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L92] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L93] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L94] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_45 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L95] SORT_45 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_45; [L97] SORT_3 init_9_arg_1 = var_7; [L98] state_8 = init_9_arg_1 [L99] SORT_3 init_14_arg_1 = var_7; [L100] state_13 = init_14_arg_1 [L101] SORT_3 init_25_arg_1 = var_7; [L102] state_24 = init_25_arg_1 [L103] SORT_3 init_27_arg_1 = var_7; [L104] state_26 = init_27_arg_1 [L105] SORT_3 init_29_arg_1 = var_7; [L106] state_28 = init_29_arg_1 [L107] SORT_1 init_31_arg_1 = var_11; [L108] state_30 = init_31_arg_1 [L109] SORT_5 init_34_arg_1 = var_32; [L110] state_33 = init_34_arg_1 [L111] SORT_3 init_36_arg_1 = var_7; [L112] state_35 = init_36_arg_1 [L113] SORT_3 init_38_arg_1 = var_7; [L114] state_37 = init_38_arg_1 [L115] SORT_3 init_40_arg_1 = var_7; [L116] state_39 = init_40_arg_1 [L117] SORT_3 init_42_arg_1 = var_7; [L118] state_41 = init_42_arg_1 [L119] SORT_3 init_44_arg_1 = var_7; [L120] state_43 = init_44_arg_1 [L121] SORT_45 init_48_arg_1 = var_46; [L122] state_47 = init_48_arg_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_164 = __VERIFIER_nondet_uchar() [L129] input_165 = __VERIFIER_nondet_uchar() [L130] input_166 = __VERIFIER_nondet_uchar() [L131] input_175 = __VERIFIER_nondet_uchar() [L132] input_185 = __VERIFIER_nondet_uchar() [L133] input_186 = __VERIFIER_nondet_uchar() [L134] input_187 = __VERIFIER_nondet_uchar() [L135] input_190 = __VERIFIER_nondet_uchar() [L136] input_209 = __VERIFIER_nondet_uchar() [L137] input_210 = __VERIFIER_nondet_uchar() [L138] input_211 = __VERIFIER_nondet_uchar() [L139] input_214 = __VERIFIER_nondet_uchar() [L140] input_216 = __VERIFIER_nondet_uchar() [L141] input_230 = __VERIFIER_nondet_uchar() [L142] input_231 = __VERIFIER_nondet_uchar() [L143] input_232 = __VERIFIER_nondet_uchar() [L146] SORT_3 var_10_arg_0 = state_8; [L147] SORT_1 var_10 = var_10_arg_0 >> 0; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_10=0, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L148] EXPR var_10 & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L148] var_10 = var_10 & mask_SORT_1 [L149] SORT_1 var_12_arg_0 = var_10; [L150] SORT_1 var_12_arg_1 = var_11; [L151] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L152] SORT_3 var_15_arg_0 = state_13; [L153] SORT_1 var_15 = var_15_arg_0 >> 0; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_12=1, var_145=0, var_15=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L154] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_12=1, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L154] var_15 = var_15 & mask_SORT_1 [L155] SORT_1 var_16_arg_0 = var_15; [L156] SORT_1 var_16_arg_1 = var_11; [L157] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L158] SORT_1 var_17_arg_0 = var_12; [L159] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_17_arg_0=1, var_17_arg_1=1, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L160] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L160] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L161] SORT_1 var_21_arg_0 = var_17; [L162] SORT_1 var_21 = ~var_21_arg_0; [L163] SORT_1 var_22_arg_0 = var_20; [L164] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_22_arg_0=1, var_22_arg_1=-2, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L165] EXPR var_22_arg_0 & var_22_arg_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L165] SORT_1 var_22 = var_22_arg_0 & var_22_arg_1; [L166] EXPR var_22 & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L166] var_22 = var_22 & mask_SORT_1 [L167] SORT_1 bad_23_arg_0 = var_22; [L168] CALL __VERIFIER_assert(!(bad_23_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 528 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3300 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3300 mSDsluCounter, 15004 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10510 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 733 IncrementalHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 4494 mSDtfsCounter, 733 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=541occurred in iteration=6, InterpolantAutomatonStates: 31, 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, 6 MinimizatonAttempts, 95 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 757 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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:49,785 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_p02.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 c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:03:52,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:03:52,240 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:52,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:03:52,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:03:52,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:03:52,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:03:52,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:03:52,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:03:52,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:03:52,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:03:52,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:03:52,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:03:52,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:03:52,295 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:03:52,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:03:52,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:03:52,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:03:52,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:03:52,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:03:52,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:03:52,297 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:03:52,297 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:03:52,297 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:03:52,299 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:03:52,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:03:52,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:03:52,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:03:52,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:03:52,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:03:52,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:03:52,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:52,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:03:52,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:03:52,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:03:52,303 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:03:52,303 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:03:52,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:03:52,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:03:52,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:03:52,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:03:52,305 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:03:52,305 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 -> c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 [2024-10-11 07:03:52,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:03:52,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:03:52,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:03:52,692 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:03:52,693 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:03:52,694 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_p02.c [2024-10-11 07:03:54,295 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:03:54,600 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:03:54,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c [2024-10-11 07:03:54,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ff7c06db3/6ddf64fa77c14e81a4acee7228c664d5/FLAG1f0ddc319 [2024-10-11 07:03:54,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ff7c06db3/6ddf64fa77c14e81a4acee7228c664d5 [2024-10-11 07:03:54,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:03:54,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:03:54,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:54,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:03:54,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:03:54,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:54" (1/1) ... [2024-10-11 07:03:54,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ae4df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:54, skipping insertion in model container [2024-10-11 07:03:54,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:54" (1/1) ... [2024-10-11 07:03:54,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:03:54,955 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_p02.c[1259,1272] [2024-10-11 07:03:55,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:55,227 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:03:55,240 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_p02.c[1259,1272] [2024-10-11 07:03:55,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:55,356 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:03:55,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:55 WrapperNode [2024-10-11 07:03:55,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:55,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:55,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:03:55,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:03:55,365 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:55" (1/1) ... [2024-10-11 07:03:55,407 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:55" (1/1) ... [2024-10-11 07:03:55,491 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1072 [2024-10-11 07:03:55,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:55,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:03:55,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:03:55,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:03:55,503 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:55" (1/1) ... [2024-10-11 07:03:55,504 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:55" (1/1) ... [2024-10-11 07:03:55,520 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:55" (1/1) ... [2024-10-11 07:03:55,559 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:55,559 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:55" (1/1) ... [2024-10-11 07:03:55,560 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:55" (1/1) ... [2024-10-11 07:03:55,602 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:55" (1/1) ... [2024-10-11 07:03:55,605 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:55" (1/1) ... [2024-10-11 07:03:55,613 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:55" (1/1) ... [2024-10-11 07:03:55,623 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:55" (1/1) ... [2024-10-11 07:03:55,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:03:55,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:03:55,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:03:55,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:03:55,643 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:55" (1/1) ... [2024-10-11 07:03:55,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:55,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:03:55,682 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:55,686 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:55,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:03:55,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:03:55,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:03:55,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:03:56,016 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:03:56,018 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:03:57,430 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-10-11 07:03:57,430 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:03:57,498 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:03:57,499 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:03:57,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:57 BoogieIcfgContainer [2024-10-11 07:03:57,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:03:57,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:03:57,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:03:57,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:03:57,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:03:54" (1/3) ... [2024-10-11 07:03:57,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3eae7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:57, skipping insertion in model container [2024-10-11 07:03:57,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:55" (2/3) ... [2024-10-11 07:03:57,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3eae7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:57, skipping insertion in model container [2024-10-11 07:03:57,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:57" (3/3) ... [2024-10-11 07:03:57,510 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c [2024-10-11 07:03:57,527 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:03:57,527 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:03:57,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:03:57,613 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;@422e49de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:03:57,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:03:57,618 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:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 07:03:57,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:57,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 07:03:57,626 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:57,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:57,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 07:03:57,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:03:57,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053167276] [2024-10-11 07:03:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:57,648 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,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:03:57,651 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:57,653 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,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:57,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 07:03:57,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:03:58,139 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:58,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:03:58,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:03:58,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053167276] [2024-10-11 07:03:58,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053167276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:58,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:58,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:03:58,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166629253] [2024-10-11 07:03:58,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:58,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:03:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:03:58,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:03:58,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:58,176 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:58,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:58,289 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 07:03:58,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:03:58,292 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:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:58,299 INFO L225 Difference]: With dead ends: 15 [2024-10-11 07:03:58,299 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 07:03:58,301 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:58,304 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:58,305 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:58,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 07:03:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 07:03:58,336 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:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 07:03:58,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 07:03:58,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:58,339 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 07:03:58,339 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:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 07:03:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 07:03:58,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:58,340 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 07:03:58,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 07:03:58,543 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:58,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:58,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:58,545 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 07:03:58,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:03:58,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843696029] [2024-10-11 07:03:58,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:58,547 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:58,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:03:58,549 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:58,550 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,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:58,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 07:03:58,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:03:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:59,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:04:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:01,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:04:01,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843696029] [2024-10-11 07:04:01,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843696029] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:04:01,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:04:01,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 07:04:01,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106605218] [2024-10-11 07:04:01,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:04:01,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:04:01,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:04:01,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:04:01,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:04:01,588 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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:04:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:01,873 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-11 07:04:01,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:04:01,874 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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 7 [2024-10-11 07:04:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:01,874 INFO L225 Difference]: With dead ends: 14 [2024-10-11 07:04:01,874 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 07:04:01,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:04:01,876 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:01,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:04:01,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 07:04:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-11 07:04:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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:04:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-11 07:04:01,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-11 07:04:01,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:01,881 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-11 07:04:01,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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:04:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-11 07:04:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 07:04:01,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:01,882 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-11 07:04:01,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 07:04:02,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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:04:02,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:02,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:02,084 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-11 07:04:02,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:04:02,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789423760] [2024-10-11 07:04:02,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 07:04:02,086 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:04:02,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:04:02,088 INFO L229 MonitoredProcess]: Starting monitored process 4 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:04:02,089 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 (4)] Waiting until timeout for monitored process [2024-10-11 07:04:02,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 07:04:02,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 07:04:02,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 07:04:02,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:04:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:03,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:04:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:51,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:04:51,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789423760] [2024-10-11 07:04:51,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789423760] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:04:51,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:04:51,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-11 07:04:51,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551480140] [2024-10-11 07:04:51,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:04:51,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 07:04:51,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:04:51,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 07:04:51,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:04:51,579 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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:04:52,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:52,116 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-10-11 07:04:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:04:52,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 10 [2024-10-11 07:04:52,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:52,117 INFO L225 Difference]: With dead ends: 17 [2024-10-11 07:04:52,117 INFO L226 Difference]: Without dead ends: 15 [2024-10-11 07:04:52,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-11 07:04:52,119 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:52,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 13 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:04:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-11 07:04:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-11 07:04:52,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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:04:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-11 07:04:52,125 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2024-10-11 07:04:52,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:52,125 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-11 07:04:52,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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:04:52,125 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-11 07:04:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 07:04:52,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:52,126 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-11 07:04:52,133 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 (4)] Forceful destruction successful, exit code 0 [2024-10-11 07:04:52,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:04:52,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:52,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:52,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 3 times [2024-10-11 07:04:52,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:04:52,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319806499] [2024-10-11 07:04:52,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 07:04:52,330 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:04:52,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:04:52,333 INFO L229 MonitoredProcess]: Starting monitored process 5 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:04:52,336 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 (5)] Waiting until timeout for monitored process [2024-10-11 07:04:52,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-11 07:04:52,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 07:04:52,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-11 07:04:52,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:04:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:53,561 INFO L311 TraceCheckSpWp]: Computing backward predicates...