/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'cvc4 --incremental --print-success --lang smt' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-04 22:55:43,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-04 22:55:43,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-04 22:55:43,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-04 22:55:43,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-04 22:55:43,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-04 22:55:43,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-04 22:55:43,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-04 22:55:43,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-04 22:55:43,453 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-04 22:55:43,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-04 22:55:43,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-04 22:55:43,454 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-04 22:55:43,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-04 22:55:43,456 INFO L153 SettingsManager]: * Use SBE=true [2024-11-04 22:55:43,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-04 22:55:43,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-04 22:55:43,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-04 22:55:43,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-04 22:55:43,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-04 22:55:43,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-04 22:55:43,457 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-04 22:55:43,458 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-04 22:55:43,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-04 22:55:43,458 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-04 22:55:43,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-04 22:55:43,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-04 22:55:43,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-04 22:55:43,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-04 22:55:43,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-04 22:55:43,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-04 22:55:43,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 22:55:43,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-04 22:55:43,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-04 22:55:43,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-04 22:55:43,461 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-04 22:55:43,461 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-04 22:55:43,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-04 22:55:43,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-04 22:55:43,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-04 22:55:43,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-04 22:55:43,463 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> cvc4 --incremental --print-success --lang smt [2024-11-04 22:55:43,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-04 22:55:43,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-04 22:55:43,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-04 22:55:43,720 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-04 22:55:43,720 INFO L274 PluginConnector]: CDTParser initialized [2024-11-04 22:55:43,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c [2024-11-04 22:55:45,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-04 22:55:45,369 INFO L384 CDTParser]: Found 1 translation units. [2024-11-04 22:55:45,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c [2024-11-04 22:55:45,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8dfd7bab/4b01019b8b2743ef9db78f926f20e393/FLAG2cb03ca88 [2024-11-04 22:55:45,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8dfd7bab/4b01019b8b2743ef9db78f926f20e393 [2024-11-04 22:55:45,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-04 22:55:45,402 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-04 22:55:45,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-04 22:55:45,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-04 22:55:45,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-04 22:55:45,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 10:55:45" (1/1) ... [2024-11-04 22:55:45,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff71eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 10:55:45, skipping insertion in model container [2024-11-04 22:55:45,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 10:55:45" (1/1) ... [2024-11-04 22:55:45,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-04 22:55:45,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c[1259,1272] [2024-11-04 22:55:45,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 22:55:45,668 INFO L200 MainTranslator]: Completed pre-run [2024-11-04 22:55:45,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p04.c[1259,1272] [2024-11-04 22:55:45,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-04 22:55:45,721 INFO L204 MainTranslator]: Completed translation [2024-11-04 22:55:45,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 10:55:45 WrapperNode [2024-11-04 22:55:45,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-04 22:55:45,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-04 22:55:45,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-04 22:55:45,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-04 22:55:45,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 10:55:45" (1/1) ... [2024-11-04 22:55:45,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 10:55:45" (1/1) ... [2024-11-04 22:55:45,766 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 136 [2024-11-04 22:55:45,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-04 22:55:45,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-04 22:55:45,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-04 22:55:45,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-04 22:55:45,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 10:55:45" (1/1) ... [2024-11-04 22:55:45,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 10:55:45" (1/1) ... [2024-11-04 22:55:45,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 10:55:45" (1/1) ... [2024-11-04 22:55:45,798 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-04 22:55:45,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 10:55:45" (1/1) ... [2024-11-04 22:55:45,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 10:55:45" (1/1) ... [2024-11-04 22:55:45,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 10:55:45" (1/1) ... [2024-11-04 22:55:45,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 10:55:45" (1/1) ... [2024-11-04 22:55:45,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 10:55:45" (1/1) ... [2024-11-04 22:55:45,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 10:55:45" (1/1) ... [2024-11-04 22:55:45,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-04 22:55:45,812 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-04 22:55:45,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-04 22:55:45,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-04 22:55:45,813 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 10:55:45" (1/1) ... [2024-11-04 22:55:45,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-04 22:55:45,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-04 22:55:45,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-04 22:55:45,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-04 22:55:45,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-04 22:55:45,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-04 22:55:45,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-04 22:55:45,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-04 22:55:46,004 INFO L238 CfgBuilder]: Building ICFG [2024-11-04 22:55:46,006 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-04 22:55:46,220 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-04 22:55:46,220 INFO L287 CfgBuilder]: Performing block encoding [2024-11-04 22:55:46,230 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-04 22:55:46,230 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-04 22:55:46,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 10:55:46 BoogieIcfgContainer [2024-11-04 22:55:46,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-04 22:55:46,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-04 22:55:46,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-04 22:55:46,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-04 22:55:46,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 10:55:45" (1/3) ... [2024-11-04 22:55:46,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fc410e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 10:55:46, skipping insertion in model container [2024-11-04 22:55:46,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 10:55:45" (2/3) ... [2024-11-04 22:55:46,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fc410e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 10:55:46, skipping insertion in model container [2024-11-04 22:55:46,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 10:55:46" (3/3) ... [2024-11-04 22:55:46,237 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p04.c [2024-11-04 22:55:46,249 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-04 22:55:46,250 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-04 22:55:46,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-04 22:55:46,299 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;@61b3b667, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-04 22:55:46,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-04 22:55:46,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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-11-04 22:55:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-04 22:55:46,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 22:55:46,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-04 22:55:46,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 22:55:46,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 22:55:46,312 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-04 22:55:46,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 22:55:46,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1504859636] [2024-11-04 22:55:46,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 22:55:46,319 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 22:55:46,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 22:55:46,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 22:55:46,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-04 22:55:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 22:55:46,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-04 22:55:46,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 22:55:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-04 22:55:46,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 22:55:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-04 22:55:46,862 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 22:55:46,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1504859636] [2024-11-04 22:55:46,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1504859636] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-04 22:55:46,863 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-04 22:55:46,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-04 22:55:46,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455638708] [2024-11-04 22:55:46,866 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-04 22:55:46,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-04 22:55:46,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 22:55:46,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-04 22:55:46,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-04 22:55:46,891 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) Second operand has 6 states, 6 states have (on average 1.3333333333333333) 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-11-04 22:55:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 22:55:46,941 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-04 22:55:46,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-04 22:55:46,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) 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) Word has length 5 [2024-11-04 22:55:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 22:55:46,950 INFO L225 Difference]: With dead ends: 18 [2024-11-04 22:55:46,950 INFO L226 Difference]: Without dead ends: 10 [2024-11-04 22:55:46,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-04 22:55:46,957 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 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-11-04 22:55:46,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-04 22:55:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-04 22:55:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-04 22:55:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-11-04 22:55:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-04 22:55:46,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-04 22:55:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 22:55:46,994 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-04 22:55:46,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) 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-11-04 22:55:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-04 22:55:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-04 22:55:46,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 22:55:46,996 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-04 22:55:46,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Ended with exit code 0 [2024-11-04 22:55:47,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 22:55:47,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 22:55:47,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 22:55:47,198 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-04 22:55:47,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 22:55:47,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [769118449] [2024-11-04 22:55:47,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 22:55:47,199 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 22:55:47,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 22:55:47,200 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 22:55:47,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-04 22:55:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 22:55:47,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-04 22:55:47,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 22:55:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-04 22:55:47,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 22:55:52,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_9~0#1|))) (let ((.cse5 (= .cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_52~0#1|)))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_8~0#1|)))) (.cse0 (not .cse5)) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_12~0#1|)) (.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_50~0#1|)))))))) (and (or (and (or .cse0 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse2))) (_ bv2 32))))))) .cse3)))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (not (= .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse4))) (_ bv2 32)))))))))) .cse5)) (forall ((|v_ULTIMATE.start_main_~var_18_arg_1~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_0~0#1_11| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_11|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_11|))))))))) (or (forall ((|v_ULTIMATE.start_main_~var_18_arg_1~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_0~0#1_11| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_11|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_11|)))))))) (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse2))) (_ bv2 32))))))) .cse3)) .cse0) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (= .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse4))) (_ bv2 32))))))))) .cse5))))))) is different from false [2024-11-04 22:55:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-04 22:55:53,527 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 22:55:53,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [769118449] [2024-11-04 22:55:53,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [769118449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 22:55:53,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 22:55:53,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-04 22:55:53,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231408892] [2024-11-04 22:55:53,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 22:55:53,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-04 22:55:53,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 22:55:53,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-04 22:55:53,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-04 22:55:53,530 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-11-04 22:55:53,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 22:55:53,997 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-04 22:55:53,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-04 22:55:53,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) Word has length 8 [2024-11-04 22:55:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 22:55:53,998 INFO L225 Difference]: With dead ends: 15 [2024-11-04 22:55:53,998 INFO L226 Difference]: Without dead ends: 13 [2024-11-04 22:55:53,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=31, Invalid=44, Unknown=1, NotChecked=14, Total=90 [2024-11-04 22:55:54,000 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-04 22:55:54,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2024-11-04 22:55:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-04 22:55:54,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-04 22:55:54,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-11-04 22:55:54,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-04 22:55:54,005 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-04 22:55:54,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 22:55:54,005 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-04 22:55:54,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-11-04 22:55:54,005 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-04 22:55:54,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-04 22:55:54,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 22:55:54,006 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-04 22:55:54,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-04 22:55:54,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 22:55:54,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 22:55:54,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 22:55:54,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-04 22:55:54,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 22:55:54,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1701710089] [2024-11-04 22:55:54,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 22:55:54,209 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 22:55:54,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 22:55:54,212 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 22:55:54,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-04 22:55:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 22:55:54,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-04 22:55:54,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 22:55:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-04 22:55:55,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 22:56:03,212 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse21 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_9~0#1|)) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_52~0#1|)) (.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse5 (forall ((|v_ULTIMATE.start_main_~var_23_arg_0~0#1_17| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_1~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_17|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_17|))))))))) (.cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_8~0#1|)))) (.cse6 (forall ((|v_ULTIMATE.start_main_~var_23_arg_0~0#1_17| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_18_arg_1~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_17|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_17|))))))))))))))) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_12~0#1|)) (.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_50~0#1|)) (.cse13 (= .cse21 .cse3))) (and (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse4))))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse1 (_ bv2 32))))))) .cse2)) (not (= .cse3 .cse1))))) .cse5) (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|) .cse4))))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse7 (_ bv2 32))))))) .cse2) (not (= .cse3 .cse7)))))) (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (let ((.cse10 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 .cse4))))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse8 .cse9))))) .cse10))) (_ bv2 32))))))) .cse2) (= .cse3 .cse8)))))) (or .cse5 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (let ((.cse12 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse4))))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 .cse9))))) .cse12))) (_ bv2 32))))))) .cse2)) (= .cse3 .cse11))))))) (not .cse13)) (or (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse21 .cse9))))))) (and (or .cse5 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse16))))) (or (not (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 .cse9))))) .cse15))) (_ bv2 32))))))))) (= .cse14 .cse3)))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse4))) (_ bv2 32))))))) .cse2)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse16))) .cse3))))) .cse5) (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (let ((.cse18 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse16))) .cse3)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse4))) (_ bv2 32))))))) .cse2))))) (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_7~0#1| (_ BitVec 8))) (let ((.cse20 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_7~0#1|))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse16))))) (or (= .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvashr ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 .cse9))))) .cse20))) (_ bv2 32)))))))) (= .cse19 .cse3)))))))) .cse13)))) is different from false [2024-11-04 22:56:05,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-04 22:56:05,480 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 22:56:05,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1701710089] [2024-11-04 22:56:05,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1701710089] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 22:56:05,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 22:56:05,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-04 22:56:05,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918249866] [2024-11-04 22:56:05,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 22:56:05,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-04 22:56:05,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 22:56:05,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-04 22:56:05,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2024-11-04 22:56:05,485 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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-11-04 22:56:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-04 22:56:08,859 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-11-04 22:56:08,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-04 22:56:08,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 11 [2024-11-04 22:56:08,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-04 22:56:08,861 INFO L225 Difference]: With dead ends: 21 [2024-11-04 22:56:08,861 INFO L226 Difference]: Without dead ends: 19 [2024-11-04 22:56:08,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=63, Invalid=122, Unknown=1, NotChecked=24, Total=210 [2024-11-04 22:56:08,863 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-04 22:56:08,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 12 Unchecked, 0.9s Time] [2024-11-04 22:56:08,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-04 22:56:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-04 22:56:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-11-04 22:56:08,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-04 22:56:08,868 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2024-11-04 22:56:08,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-04 22:56:08,869 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-04 22:56:08,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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-11-04 22:56:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-04 22:56:08,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-04 22:56:08,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-04 22:56:08,869 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2024-11-04 22:56:08,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-11-04 22:56:09,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-04 22:56:09,071 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-04 22:56:09,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-04 22:56:09,072 INFO L85 PathProgramCache]: Analyzing trace with hash -37306491, now seen corresponding path program 3 times [2024-11-04 22:56:09,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-04 22:56:09,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [365212836] [2024-11-04 22:56:09,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-04 22:56:09,072 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-04 22:56:09,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-04 22:56:09,075 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-04 22:56:09,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-04 22:56:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-04 22:56:09,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-04 22:56:09,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-04 22:56:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-04 22:56:15,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-04 22:56:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-04 22:56:58,842 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-04 22:56:58,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [365212836] [2024-11-04 22:56:58,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [365212836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-04 22:56:58,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-04 22:56:58,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-04 22:56:58,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425753095] [2024-11-04 22:56:58,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-04 22:56:58,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-04 22:56:58,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-04 22:56:58,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-04 22:56:58,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-04 22:56:58,848 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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-11-04 22:57:10,555 WARN L286 SmtUtils]: Spent 8.75s on a formula simplification. DAG size of input: 348 DAG size of output: 232 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-04 22:57:19,516 WARN L286 SmtUtils]: Spent 8.59s on a formula simplification. DAG size of input: 351 DAG size of output: 234 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)