/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 'cvc5 --incremental --print-success --lang smt' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-70.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 04:50:35,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 04:50:35,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 04:50:35,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 04:50:35,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 04:50:35,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 04:50:35,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 04:50:35,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 04:50:35,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 04:50:35,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 04:50:35,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 04:50:35,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 04:50:35,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 04:50:35,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 04:50:35,252 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 04:50:35,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 04:50:35,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 04:50:35,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 04:50:35,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 04:50:35,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 04:50:35,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 04:50:35,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 04:50:35,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 04:50:35,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 04:50:35,255 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 04:50:35,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 04:50:35,256 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 04:50:35,256 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 04:50:35,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 04:50:35,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 04:50:35,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 04:50:35,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 04:50:35,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 04:50:35,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 04:50:35,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 04:50:35,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 04:50:35,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 04:50:35,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 04:50:35,258 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 04:50:35,258 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 04:50:35,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 04:50:35,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 04:50:35,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 04:50:35,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 04:50:35,259 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 -> cvc5 --incremental --print-success --lang smt [2024-11-03 04:50:35,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 04:50:35,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 04:50:35,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 04:50:35,418 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 04:50:35,418 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 04:50:35,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-70.i [2024-11-03 04:50:36,784 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 04:50:36,968 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 04:50:36,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-70.i [2024-11-03 04:50:36,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31c1efc32/7edadd8a89d24f6a81746aa51796d1b7/FLAG98ea173d9 [2024-11-03 04:50:37,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31c1efc32/7edadd8a89d24f6a81746aa51796d1b7 [2024-11-03 04:50:37,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 04:50:37,362 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 04:50:37,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 04:50:37,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 04:50:37,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 04:50:37,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:50:37" (1/1) ... [2024-11-03 04:50:37,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7528660f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:50:37, skipping insertion in model container [2024-11-03 04:50:37,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:50:37" (1/1) ... [2024-11-03 04:50:37,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 04:50:37,501 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-70.i[915,928] [2024-11-03 04:50:37,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 04:50:37,534 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 04:50:37,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-70.i[915,928] [2024-11-03 04:50:37,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 04:50:37,564 INFO L204 MainTranslator]: Completed translation [2024-11-03 04:50:37,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:50:37 WrapperNode [2024-11-03 04:50:37,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 04:50:37,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 04:50:37,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 04:50:37,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 04:50:37,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:50:37" (1/1) ... [2024-11-03 04:50:37,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:50:37" (1/1) ... [2024-11-03 04:50:37,591 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 64 [2024-11-03 04:50:37,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 04:50:37,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 04:50:37,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 04:50:37,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 04:50:37,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:50:37" (1/1) ... [2024-11-03 04:50:37,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:50:37" (1/1) ... [2024-11-03 04:50:37,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:50:37" (1/1) ... [2024-11-03 04:50:37,614 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-03 04:50:37,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:50:37" (1/1) ... [2024-11-03 04:50:37,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:50:37" (1/1) ... [2024-11-03 04:50:37,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:50:37" (1/1) ... [2024-11-03 04:50:37,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:50:37" (1/1) ... [2024-11-03 04:50:37,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:50:37" (1/1) ... [2024-11-03 04:50:37,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:50:37" (1/1) ... [2024-11-03 04:50:37,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 04:50:37,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 04:50:37,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 04:50:37,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 04:50:37,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:50:37" (1/1) ... [2024-11-03 04:50:37,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 04:50:37,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 04:50:37,657 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-03 04:50:37,663 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-03 04:50:37,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 04:50:37,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 04:50:37,686 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-03 04:50:37,686 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-03 04:50:37,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 04:50:37,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 04:50:37,744 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 04:50:37,746 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 04:50:37,922 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-03 04:50:37,922 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 04:50:37,930 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 04:50:37,930 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 04:50:37,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:50:37 BoogieIcfgContainer [2024-11-03 04:50:37,930 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 04:50:37,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 04:50:37,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 04:50:37,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 04:50:37,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:50:37" (1/3) ... [2024-11-03 04:50:37,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6d9b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:50:37, skipping insertion in model container [2024-11-03 04:50:37,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:50:37" (2/3) ... [2024-11-03 04:50:37,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6d9b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:50:37, skipping insertion in model container [2024-11-03 04:50:37,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:50:37" (3/3) ... [2024-11-03 04:50:37,936 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-70.i [2024-11-03 04:50:37,946 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 04:50:37,946 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 04:50:38,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 04:50:38,046 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;@5f9523c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 04:50:38,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 04:50:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-03 04:50:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-03 04:50:38,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 04:50:38,056 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 04:50:38,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 04:50:38,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 04:50:38,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1958802902, now seen corresponding path program 1 times [2024-11-03 04:50:38,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 04:50:38,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1084144365] [2024-11-03 04:50:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 04:50:38,068 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 04:50:38,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 04:50:38,071 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 04:50:38,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-03 04:50:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 04:50:38,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 04:50:38,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 04:50:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-03 04:50:38,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 04:50:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-03 04:50:38,229 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 04:50:38,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1084144365] [2024-11-03 04:50:38,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1084144365] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 04:50:38,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 04:50:38,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-03 04:50:38,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858146315] [2024-11-03 04:50:38,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 04:50:38,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 04:50:38,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 04:50:38,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 04:50:38,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 04:50:38,251 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-03 04:50:38,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 04:50:38,264 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2024-11-03 04:50:38,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 04:50:38,265 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-11-03 04:50:38,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 04:50:38,270 INFO L225 Difference]: With dead ends: 57 [2024-11-03 04:50:38,270 INFO L226 Difference]: Without dead ends: 28 [2024-11-03 04:50:38,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 04:50:38,274 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 04:50:38,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 04:50:38,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-03 04:50:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-03 04:50:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-03 04:50:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-11-03 04:50:38,299 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 44 [2024-11-03 04:50:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 04:50:38,299 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-11-03 04:50:38,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-03 04:50:38,300 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-11-03 04:50:38,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-03 04:50:38,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 04:50:38,301 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 04:50:38,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (2)] Ended with exit code 0 [2024-11-03 04:50:38,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 04:50:38,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 04:50:38,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 04:50:38,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1139575634, now seen corresponding path program 1 times [2024-11-03 04:50:38,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 04:50:38,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [982120722] [2024-11-03 04:50:38,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 04:50:38,505 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 04:50:38,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 04:50:38,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 04:50:38,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-03 04:50:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 04:50:38,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-03 04:50:38,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 04:50:47,304 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-03 04:50:47,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 04:51:27,531 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-03 04:51:27,531 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 04:51:27,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [982120722] [2024-11-03 04:51:27,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [982120722] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 04:51:27,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 04:51:27,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2024-11-03 04:51:27,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583171290] [2024-11-03 04:51:27,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 04:51:27,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-03 04:51:27,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 04:51:27,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-03 04:51:27,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2024-11-03 04:51:27,535 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-03 04:51:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 04:51:31,545 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-11-03 04:51:31,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-03 04:51:31,550 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-11-03 04:51:31,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 04:51:31,551 INFO L225 Difference]: With dead ends: 46 [2024-11-03 04:51:31,551 INFO L226 Difference]: Without dead ends: 44 [2024-11-03 04:51:31,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2024-11-03 04:51:31,553 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 67 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-03 04:51:31,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 106 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-03 04:51:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-03 04:51:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2024-11-03 04:51:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-03 04:51:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-11-03 04:51:31,570 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 44 [2024-11-03 04:51:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 04:51:31,570 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-03 04:51:31,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-03 04:51:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-11-03 04:51:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-03 04:51:31,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 04:51:31,574 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 04:51:31,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-03 04:51:31,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 04:51:31,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 04:51:31,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 04:51:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash -911757502, now seen corresponding path program 1 times [2024-11-03 04:51:31,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 04:51:31,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1402875009] [2024-11-03 04:51:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 04:51:31,777 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 04:51:31,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 04:51:31,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 04:51:31,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-03 04:51:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 04:51:31,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-03 04:51:31,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 04:51:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-03 04:51:35,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 04:51:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-03 04:51:44,390 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 04:51:44,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1402875009] [2024-11-03 04:51:44,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1402875009] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 04:51:44,390 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 04:51:44,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2024-11-03 04:51:44,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289647174] [2024-11-03 04:51:44,391 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 04:51:44,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-03 04:51:44,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 04:51:44,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-03 04:51:44,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-03 04:51:44,392 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-03 04:51:48,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 04:51:48,637 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2024-11-03 04:51:48,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-03 04:51:48,637 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 45 [2024-11-03 04:51:48,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 04:51:48,638 INFO L225 Difference]: With dead ends: 80 [2024-11-03 04:51:48,639 INFO L226 Difference]: Without dead ends: 78 [2024-11-03 04:51:48,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-03 04:51:48,640 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 25 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-03 04:51:48,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 222 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-03 04:51:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-03 04:51:48,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2024-11-03 04:51:48,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-03 04:51:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2024-11-03 04:51:48,647 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 45 [2024-11-03 04:51:48,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 04:51:48,648 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2024-11-03 04:51:48,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-03 04:51:48,648 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2024-11-03 04:51:48,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-03 04:51:48,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 04:51:48,651 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 04:51:48,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-03 04:51:48,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 04:51:48,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 04:51:48,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 04:51:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1879079429, now seen corresponding path program 1 times [2024-11-03 04:51:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 04:51:48,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [173778168] [2024-11-03 04:51:48,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 04:51:48,852 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 04:51:48,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 04:51:48,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 04:51:48,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-03 04:51:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 04:51:49,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-03 04:51:49,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 04:52:15,054 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (.cse0 (= |c_ULTIMATE.start_property_#res#1| (_ bv1 32))) (.cse1 (= |c_ULTIMATE.start_property_#res#1| (_ bv0 32)))) (or (and .cse0 (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (fp.eq (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0) ~var_1_5~0))) (and .cse1 (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse2 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (fp.geq ~var_1_4~0 ~var_1_5~0) (not (fp.eq .cse2 ~var_1_5~0)) (not (fp.eq .cse2 (fp.neg ~var_1_5~0))) (fp.eq .cse2 .cse2))))) (and .cse1 (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse3 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (not (fp.eq .cse3 ~var_1_4~0)) (fp.geq ~var_1_4~0 ~var_1_5~0) (fp.eq .cse3 (fp.neg ~var_1_5~0)))))) (and .cse0 (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse4 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (not (fp.geq ~var_1_4~0 ~var_1_5~0)) (not (fp.eq .cse4 ~var_1_5~0)) (not (fp.eq .cse4 (fp.neg ~var_1_5~0))))))) (and .cse1 (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_4~0 ~var_1_5~0) (not (let ((.cse5 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (fp.eq .cse5 .cse5)))))) (and (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse6 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (fp.eq .cse6 (fp.neg ~var_1_5~0)) (not (fp.eq .cse6 ~var_1_5~0))))) .cse0) (and .cse0 (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (and (not (fp.lt ~var_1_5~0 .cse7)) (not (fp.geq ~var_1_4~0 ~var_1_5~0)) (not (fp.eq (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0) (fp.neg ~var_1_5~0)))))) (and (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse8 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (fp.eq .cse8 ~var_1_4~0) (not (fp.lt ~var_1_5~0 .cse7)) (fp.geq ~var_1_4~0 ~var_1_5~0) (not (fp.eq .cse8 (fp.neg ~var_1_5~0)))))) .cse0) (and (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse9 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (not (fp.eq .cse9 ~var_1_5~0)) (fp.eq .cse9 .cse9)))) .cse0) (and .cse1 (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse10 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (not (fp.eq .cse10 ~var_1_4~0)) (fp.geq ~var_1_4~0 ~var_1_5~0) (fp.eq .cse10 ~var_1_5~0))))) (and .cse1 (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (and (not (fp.lt ~var_1_5~0 .cse7)) (fp.geq ~var_1_4~0 ~var_1_5~0) (not (let ((.cse11 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (fp.eq .cse11 .cse11)))))) (and .cse1 (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse12 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (not (fp.lt ~var_1_5~0 .cse7)) (fp.geq ~var_1_4~0 ~var_1_5~0) (not (fp.eq .cse12 ~var_1_5~0)) (fp.eq .cse12 .cse12))))) (and .cse0 (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse13 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (fp.eq .cse13 ~var_1_4~0) (fp.geq ~var_1_4~0 ~var_1_5~0) (not (fp.eq .cse13 (fp.neg ~var_1_5~0))))))) (and .cse1 (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (not (let ((.cse14 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (fp.eq .cse14 .cse14))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-03 04:52:23,962 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (or (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse0 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (not (fp.eq .cse0 ~var_1_5~0)) (fp.eq .cse0 .cse0)))) (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (fp.eq .cse1 ~var_1_4~0) (not (fp.lt ~var_1_5~0 .cse2)) (fp.geq ~var_1_4~0 ~var_1_5~0) (not (fp.eq .cse1 (fp.neg ~var_1_5~0)))))) (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse3 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (fp.geq ~var_1_4~0 ~var_1_5~0) (not (fp.eq .cse3 ~var_1_5~0)) (not (fp.eq .cse3 (fp.neg ~var_1_5~0))) (fp.eq .cse3 .cse3)))) (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse4 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (fp.eq .cse4 (fp.neg ~var_1_5~0)) (not (fp.eq .cse4 ~var_1_5~0))))) (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (and (not (fp.lt ~var_1_5~0 .cse2)) (fp.geq ~var_1_4~0 ~var_1_5~0) (not (let ((.cse5 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (fp.eq .cse5 .cse5))))) (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse6 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (not (fp.eq .cse6 ~var_1_4~0)) (fp.geq ~var_1_4~0 ~var_1_5~0) (fp.eq .cse6 (fp.neg ~var_1_5~0))))) (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (and (not (fp.lt ~var_1_5~0 .cse2)) (not (fp.geq ~var_1_4~0 ~var_1_5~0)) (not (fp.eq (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0) (fp.neg ~var_1_5~0))))) (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse7 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (not (fp.eq .cse7 ~var_1_4~0)) (fp.geq ~var_1_4~0 ~var_1_5~0) (fp.eq .cse7 ~var_1_5~0)))) (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse8 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (not (fp.geq ~var_1_4~0 ~var_1_5~0)) (not (fp.eq .cse8 ~var_1_5~0)) (not (fp.eq .cse8 (fp.neg ~var_1_5~0)))))) (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (fp.eq (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0) ~var_1_5~0)) (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse9 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (not (fp.lt ~var_1_5~0 .cse2)) (fp.geq ~var_1_4~0 ~var_1_5~0) (not (fp.eq .cse9 ~var_1_5~0)) (fp.eq .cse9 .cse9)))) (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_4~0 ~var_1_5~0) (not (let ((.cse10 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (fp.eq .cse10 .cse10))))) (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (not (let ((.cse11 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (fp.eq .cse11 .cse11)))) (exists ((~var_1_5~0 (_ FloatingPoint 8 24)) (~var_1_4~0 (_ FloatingPoint 8 24))) (let ((.cse12 (fp.sub c_currentRoundingMode ~var_1_4~0 ~var_1_5~0))) (and (fp.eq .cse12 ~var_1_4~0) (fp.geq ~var_1_4~0 ~var_1_5~0) (not (fp.eq .cse12 (fp.neg ~var_1_5~0)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false