/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/bitvector/soft_float_3a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 11:07:57,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 11:07:57,782 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 11:07:57,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 11:07:57,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 11:07:57,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 11:07:57,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 11:07:57,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 11:07:57,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 11:07:57,799 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 11:07:57,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 11:07:57,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 11:07:57,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 11:07:57,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 11:07:57,800 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 11:07:57,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 11:07:57,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 11:07:57,801 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 11:07:57,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 11:07:57,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 11:07:57,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 11:07:57,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 11:07:57,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 11:07:57,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 11:07:57,803 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 11:07:57,803 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 11:07:57,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 11:07:57,804 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 11:07:57,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 11:07:57,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 11:07:57,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 11:07:57,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 11:07:57,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 11:07:57,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 11:07:57,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 11:07:57,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 11:07:57,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 11:07:57,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 11:07:57,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 11:07:57,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 11:07:57,807 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 11:07:57,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 11:07:57,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 11:07:57,807 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.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 11:07:57,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 11:07:57,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 11:07:57,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 11:07:57,958 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 11:07:57,958 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 11:07:57,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_3a.c.cil.c [2023-12-20 11:07:59,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 11:07:59,223 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 11:07:59,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_3a.c.cil.c [2023-12-20 11:07:59,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d2607a5/ddc1d813810042afa5ed1e1bb0d98b97/FLAG8f5bdb5b4 [2023-12-20 11:07:59,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d2607a5/ddc1d813810042afa5ed1e1bb0d98b97 [2023-12-20 11:07:59,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 11:07:59,243 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 11:07:59,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 11:07:59,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 11:07:59,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 11:07:59,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:07:59" (1/1) ... [2023-12-20 11:07:59,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502ff39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:59, skipping insertion in model container [2023-12-20 11:07:59,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:07:59" (1/1) ... [2023-12-20 11:07:59,281 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 11:07:59,390 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_3a.c.cil.c[728,741] [2023-12-20 11:07:59,421 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 11:07:59,429 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 11:07:59,437 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_3a.c.cil.c[728,741] [2023-12-20 11:07:59,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 11:07:59,464 INFO L206 MainTranslator]: Completed translation [2023-12-20 11:07:59,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:59 WrapperNode [2023-12-20 11:07:59,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 11:07:59,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 11:07:59,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 11:07:59,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 11:07:59,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:59" (1/1) ... [2023-12-20 11:07:59,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:59" (1/1) ... [2023-12-20 11:07:59,494 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 135 [2023-12-20 11:07:59,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 11:07:59,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 11:07:59,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 11:07:59,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 11:07:59,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:59" (1/1) ... [2023-12-20 11:07:59,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:59" (1/1) ... [2023-12-20 11:07:59,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:59" (1/1) ... [2023-12-20 11:07:59,514 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]. [2023-12-20 11:07:59,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:59" (1/1) ... [2023-12-20 11:07:59,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:59" (1/1) ... [2023-12-20 11:07:59,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:59" (1/1) ... [2023-12-20 11:07:59,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:59" (1/1) ... [2023-12-20 11:07:59,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:59" (1/1) ... [2023-12-20 11:07:59,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:59" (1/1) ... [2023-12-20 11:07:59,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 11:07:59,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 11:07:59,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 11:07:59,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 11:07:59,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:59" (1/1) ... [2023-12-20 11:07:59,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 11:07:59,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:07:59,560 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) [2023-12-20 11:07:59,583 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 [2023-12-20 11:07:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 11:07:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 11:07:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-12-20 11:07:59,599 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-12-20 11:07:59,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 11:07:59,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 11:07:59,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-20 11:07:59,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-20 11:07:59,650 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 11:07:59,652 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 11:07:59,858 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 11:07:59,877 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 11:07:59,877 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-20 11:07:59,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:07:59 BoogieIcfgContainer [2023-12-20 11:07:59,878 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 11:07:59,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 11:07:59,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 11:07:59,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 11:07:59,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 11:07:59" (1/3) ... [2023-12-20 11:07:59,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b80c4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:07:59, skipping insertion in model container [2023-12-20 11:07:59,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:59" (2/3) ... [2023-12-20 11:07:59,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b80c4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:07:59, skipping insertion in model container [2023-12-20 11:07:59,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:07:59" (3/3) ... [2023-12-20 11:07:59,883 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_3a.c.cil.c [2023-12-20 11:07:59,895 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 11:07:59,896 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 11:07:59,927 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 11:07:59,951 INFO L357 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, mHoare=true, 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;@1d5108e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 11:07:59,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 11:07:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 39 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-20 11:07:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-20 11:07:59,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:07:59,967 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:07:59,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:07:59,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:07:59,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1674753075, now seen corresponding path program 1 times [2023-12-20 11:07:59,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:07:59,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544719652] [2023-12-20 11:07:59,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:07:59,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:08:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 11:08:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 11:08:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 11:08:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:08:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-20 11:08:00,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:08:00,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544719652] [2023-12-20 11:08:00,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544719652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:08:00,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:08:00,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 11:08:00,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839193716] [2023-12-20 11:08:00,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:08:00,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:08:00,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:08:00,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:08:00,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 11:08:00,283 INFO L87 Difference]: Start difference. First operand has 46 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 39 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-20 11:08:00,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:08:00,318 INFO L93 Difference]: Finished difference Result 92 states and 147 transitions. [2023-12-20 11:08:00,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:08:00,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2023-12-20 11:08:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:08:00,333 INFO L225 Difference]: With dead ends: 92 [2023-12-20 11:08:00,334 INFO L226 Difference]: Without dead ends: 42 [2023-12-20 11:08:00,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 11:08:00,338 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:08:00,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:08:00,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-20 11:08:00,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-20 11:08:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-20 11:08:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2023-12-20 11:08:00,379 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 35 [2023-12-20 11:08:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:08:00,381 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2023-12-20 11:08:00,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-20 11:08:00,382 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2023-12-20 11:08:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-20 11:08:00,385 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:08:00,385 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:08:00,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 11:08:00,386 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:08:00,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:08:00,387 INFO L85 PathProgramCache]: Analyzing trace with hash -366009767, now seen corresponding path program 1 times [2023-12-20 11:08:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:08:00,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154380656] [2023-12-20 11:08:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:08:00,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:08:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 11:08:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 11:08:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 11:08:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:08:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-20 11:08:00,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:08:00,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154380656] [2023-12-20 11:08:00,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154380656] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:08:00,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:08:00,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 11:08:00,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167497516] [2023-12-20 11:08:00,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:08:00,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 11:08:00,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:08:00,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 11:08:00,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 11:08:00,511 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-20 11:08:00,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:08:00,543 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2023-12-20 11:08:00,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 11:08:00,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-12-20 11:08:00,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:08:00,544 INFO L225 Difference]: With dead ends: 52 [2023-12-20 11:08:00,544 INFO L226 Difference]: Without dead ends: 42 [2023-12-20 11:08:00,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 11:08:00,545 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:08:00,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 165 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:08:00,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-20 11:08:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-20 11:08:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-20 11:08:00,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2023-12-20 11:08:00,553 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 37 [2023-12-20 11:08:00,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:08:00,554 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2023-12-20 11:08:00,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-20 11:08:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2023-12-20 11:08:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-20 11:08:00,555 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:08:00,555 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:08:00,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 11:08:00,555 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:08:00,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:08:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1175356393, now seen corresponding path program 1 times [2023-12-20 11:08:00,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:08:00,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617785909] [2023-12-20 11:08:00,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:08:00,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:08:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 11:08:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 11:08:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 11:08:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:08:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-20 11:08:00,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:08:00,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617785909] [2023-12-20 11:08:00,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617785909] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:08:00,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422048986] [2023-12-20 11:08:00,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:08:00,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:08:00,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:08:00,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:08:00,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 11:08:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:00,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-20 11:08:00,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:08:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-20 11:08:00,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 11:08:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-20 11:08:01,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422048986] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 11:08:01,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-20 11:08:01,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 8] total 14 [2023-12-20 11:08:01,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240631314] [2023-12-20 11:08:01,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:08:01,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 11:08:01,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:08:01,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 11:08:01,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-12-20 11:08:01,014 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-20 11:08:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:08:01,055 INFO L93 Difference]: Finished difference Result 68 states and 97 transitions. [2023-12-20 11:08:01,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 11:08:01,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-12-20 11:08:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:08:01,060 INFO L225 Difference]: With dead ends: 68 [2023-12-20 11:08:01,060 INFO L226 Difference]: Without dead ends: 48 [2023-12-20 11:08:01,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-12-20 11:08:01,065 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 3 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:08:01,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 258 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:08:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-20 11:08:01,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2023-12-20 11:08:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-20 11:08:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2023-12-20 11:08:01,082 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 37 [2023-12-20 11:08:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:08:01,082 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2023-12-20 11:08:01,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-20 11:08:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2023-12-20 11:08:01,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-20 11:08:01,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:08:01,084 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:08:01,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 11:08:01,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:08:01,285 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:08:01,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:08:01,286 INFO L85 PathProgramCache]: Analyzing trace with hash -917190955, now seen corresponding path program 1 times [2023-12-20 11:08:01,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:08:01,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751673246] [2023-12-20 11:08:01,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:08:01,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:08:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:01,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 11:08:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:01,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 11:08:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:01,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 11:08:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:01,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:08:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-20 11:08:01,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:08:01,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751673246] [2023-12-20 11:08:01,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751673246] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:08:01,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583953995] [2023-12-20 11:08:01,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:08:01,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:08:01,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:08:01,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:08:01,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 11:08:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:01,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-20 11:08:01,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:08:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-20 11:08:01,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 11:08:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-20 11:08:01,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583953995] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 11:08:01,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 11:08:01,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 6] total 14 [2023-12-20 11:08:01,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133490286] [2023-12-20 11:08:01,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 11:08:01,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 11:08:01,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:08:01,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 11:08:01,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-12-20 11:08:01,658 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-20 11:08:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:08:01,846 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2023-12-20 11:08:01,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-20 11:08:01,846 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2023-12-20 11:08:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:08:01,849 INFO L225 Difference]: With dead ends: 129 [2023-12-20 11:08:01,849 INFO L226 Difference]: Without dead ends: 84 [2023-12-20 11:08:01,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-12-20 11:08:01,852 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 36 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 11:08:01,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 371 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 11:08:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-20 11:08:01,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2023-12-20 11:08:01,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.360655737704918) internal successors, (83), 59 states have internal predecessors, (83), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-20 11:08:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2023-12-20 11:08:01,873 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 37 [2023-12-20 11:08:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:08:01,873 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2023-12-20 11:08:01,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-20 11:08:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2023-12-20 11:08:01,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-20 11:08:01,876 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:08:01,876 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:08:01,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-20 11:08:02,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-20 11:08:02,083 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:08:02,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:08:02,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1335341093, now seen corresponding path program 1 times [2023-12-20 11:08:02,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:08:02,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476597286] [2023-12-20 11:08:02,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:08:02,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:08:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:02,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 11:08:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:02,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 11:08:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:02,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 11:08:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:02,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 11:08:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-20 11:08:02,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:08:02,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476597286] [2023-12-20 11:08:02,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476597286] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:08:02,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833414059] [2023-12-20 11:08:02,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:08:02,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:08:02,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:08:02,156 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:08:02,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 11:08:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:02,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 11:08:02,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:08:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-20 11:08:02,224 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:08:02,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833414059] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:08:02,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:08:02,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-12-20 11:08:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073127268] [2023-12-20 11:08:02,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:08:02,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 11:08:02,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:08:02,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 11:08:02,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:08:02,225 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-20 11:08:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:08:02,257 INFO L93 Difference]: Finished difference Result 143 states and 207 transitions. [2023-12-20 11:08:02,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 11:08:02,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2023-12-20 11:08:02,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:08:02,258 INFO L225 Difference]: With dead ends: 143 [2023-12-20 11:08:02,258 INFO L226 Difference]: Without dead ends: 78 [2023-12-20 11:08:02,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:08:02,259 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:08:02,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 128 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:08:02,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-20 11:08:02,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2023-12-20 11:08:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.359375) internal successors, (87), 63 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) [2023-12-20 11:08:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2023-12-20 11:08:02,264 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 42 [2023-12-20 11:08:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:08:02,264 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2023-12-20 11:08:02,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-20 11:08:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2023-12-20 11:08:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-20 11:08:02,265 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:08:02,265 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:08:02,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-20 11:08:02,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:08:02,469 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:08:02,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:08:02,470 INFO L85 PathProgramCache]: Analyzing trace with hash 517388966, now seen corresponding path program 1 times [2023-12-20 11:08:02,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:08:02,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446145529] [2023-12-20 11:08:02,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:08:02,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:08:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:02,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 11:08:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 11:08:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:02,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 11:08:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:02,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-20 11:08:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-20 11:08:02,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:08:02,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446145529] [2023-12-20 11:08:02,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446145529] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:08:02,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315064357] [2023-12-20 11:08:02,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:08:02,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:08:02,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:08:02,629 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:08:02,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-20 11:08:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:02,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-20 11:08:02,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:08:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-20 11:08:02,770 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 11:08:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-20 11:08:02,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315064357] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 11:08:02,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-20 11:08:02,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 6] total 14 [2023-12-20 11:08:02,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610708606] [2023-12-20 11:08:02,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:08:02,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 11:08:02,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:08:02,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 11:08:02,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-20 11:08:02,822 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-20 11:08:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:08:02,841 INFO L93 Difference]: Finished difference Result 96 states and 130 transitions. [2023-12-20 11:08:02,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 11:08:02,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2023-12-20 11:08:02,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:08:02,842 INFO L225 Difference]: With dead ends: 96 [2023-12-20 11:08:02,843 INFO L226 Difference]: Without dead ends: 90 [2023-12-20 11:08:02,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-20 11:08:02,843 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 3 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:08:02,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 151 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:08:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-20 11:08:02,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2023-12-20 11:08:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 76 states have internal predecessors, (101), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) [2023-12-20 11:08:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2023-12-20 11:08:02,848 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 43 [2023-12-20 11:08:02,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:08:02,848 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2023-12-20 11:08:02,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-20 11:08:02,848 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2023-12-20 11:08:02,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-20 11:08:02,849 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:08:02,849 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:08:02,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-20 11:08:03,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:08:03,050 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:08:03,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:08:03,050 INFO L85 PathProgramCache]: Analyzing trace with hash 574647268, now seen corresponding path program 1 times [2023-12-20 11:08:03,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:08:03,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065865479] [2023-12-20 11:08:03,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:08:03,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:08:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:03,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 11:08:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:03,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 11:08:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:03,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 11:08:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:03,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-20 11:08:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:08:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-20 11:08:03,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:08:03,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065865479] [2023-12-20 11:08:03,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065865479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:08:03,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:08:03,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 11:08:03,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453355775] [2023-12-20 11:08:03,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:08:03,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 11:08:03,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:08:03,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 11:08:03,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:08:03,117 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-20 11:08:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:08:03,139 INFO L93 Difference]: Finished difference Result 94 states and 127 transitions. [2023-12-20 11:08:03,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 11:08:03,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2023-12-20 11:08:03,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:08:03,140 INFO L225 Difference]: With dead ends: 94 [2023-12-20 11:08:03,140 INFO L226 Difference]: Without dead ends: 78 [2023-12-20 11:08:03,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-20 11:08:03,141 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:08:03,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 265 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:08:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-20 11:08:03,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-12-20 11:08:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-20 11:08:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 105 transitions. [2023-12-20 11:08:03,145 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 105 transitions. Word has length 43 [2023-12-20 11:08:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:08:03,145 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 105 transitions. [2023-12-20 11:08:03,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-20 11:08:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 105 transitions. [2023-12-20 11:08:03,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-20 11:08:03,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:08:03,145 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:08:03,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 11:08:03,146 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:08:03,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:08:03,146 INFO L85 PathProgramCache]: Analyzing trace with hash -127641237, now seen corresponding path program 1 times [2023-12-20 11:08:03,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:08:03,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543519203] [2023-12-20 11:08:03,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:08:03,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:08:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 11:08:03,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 11:08:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 11:08:03,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 11:08:03,176 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 11:08:03,176 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 11:08:03,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 11:08:03,179 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:08:03,181 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 11:08:03,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 11:08:03 BoogieIcfgContainer [2023-12-20 11:08:03,215 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 11:08:03,216 INFO L158 Benchmark]: Toolchain (without parser) took 3972.45ms. Allocated memory is still 263.2MB. Free memory was 211.1MB in the beginning and 120.0MB in the end (delta: 91.1MB). Peak memory consumption was 91.5MB. Max. memory is 8.0GB. [2023-12-20 11:08:03,216 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory was 139.2MB in the beginning and 139.1MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 11:08:03,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.78ms. Allocated memory is still 263.2MB. Free memory was 210.7MB in the beginning and 197.4MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 11:08:03,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.15ms. Allocated memory is still 263.2MB. Free memory was 197.4MB in the beginning and 195.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 11:08:03,216 INFO L158 Benchmark]: Boogie Preprocessor took 29.50ms. Allocated memory is still 263.2MB. Free memory was 195.4MB in the beginning and 193.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 11:08:03,217 INFO L158 Benchmark]: RCFGBuilder took 352.93ms. Allocated memory is still 263.2MB. Free memory was 193.3MB in the beginning and 177.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-20 11:08:03,217 INFO L158 Benchmark]: TraceAbstraction took 3336.19ms. Allocated memory is still 263.2MB. Free memory was 176.6MB in the beginning and 120.0MB in the end (delta: 56.5MB). Peak memory consumption was 56.9MB. Max. memory is 8.0GB. [2023-12-20 11:08:03,218 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory was 139.2MB in the beginning and 139.1MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.78ms. Allocated memory is still 263.2MB. Free memory was 210.7MB in the beginning and 197.4MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.15ms. Allocated memory is still 263.2MB. Free memory was 197.4MB in the beginning and 195.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.50ms. Allocated memory is still 263.2MB. Free memory was 195.4MB in the beginning and 193.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 352.93ms. Allocated memory is still 263.2MB. Free memory was 193.3MB in the beginning and 177.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 3336.19ms. Allocated memory is still 263.2MB. Free memory was 176.6MB in the beginning and 120.0MB in the end (delta: 56.5MB). Peak memory consumption was 56.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwise operation at line 35. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=0, eb=0] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); [L238] RET, EXPR base2flt(0, 0) VAL [ea=0, eb=0] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m)=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND FALSE !(m < 1U << 24U) [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L59] COND FALSE !(m >= 1U << 25U) [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=0, e=0, m=2, res=0] [L80] return (__retres4); [L239] RET, EXPR base2flt(1, 0) VAL [ea=0, eb=0, zero=0] [L239] one = base2flt(1, 0) [L240] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND FALSE !(m < 1U << 24U) [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L59] COND FALSE !(m >= 1U << 25U) [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=4294967295, e=0, m=3, res=4294967295] [L80] return (__retres4); [L240] RET, EXPR base2flt(ma, ea) VAL [ea=0, eb=0, ma=1, one=0, zero=0] [L240] a = base2flt(ma, ea) [L241] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); [L241] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=0, eb=0, ma=1, mb=0, one=0, zero=0] [L241] b = base2flt(mb, eb) [L242] CALL, EXPR mulflt(a, b) [L148] unsigned int res ; [L149] unsigned int ma ; [L150] unsigned int mb ; [L151] unsigned long long accu ; [L152] int ea ; [L153] int eb ; [L154] unsigned int tmp ; [L155] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=0, a=4294967295, b=0] [L158] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=0, a=4294967295, b=0] [L165] COND TRUE ! b [L166] __retres10 = 0U VAL [\old(a)=4294967295, \old(b)=0, __retres10=0, a=4294967295, b=0] [L217] return (__retres10); [L242] RET, EXPR mulflt(a, b) [L242] r_mul = mulflt(a, b) [L244] COND FALSE !(b < one) VAL [a=4294967295, b=0, ea=0, eb=0, ma=1, mb=0, one=0, r_mul=0, zero=0] [L247] COND FALSE !(b > one) [L250] tmp = 0 VAL [a=4294967295, b=0, ea=0, eb=0, ma=1, mb=0, one=0, r_mul=0, tmp=0, zero=0] [L252] sb = tmp VAL [a=4294967295, b=0, ea=0, eb=0, ma=1, mb=0, one=0, r_mul=0, sb=0, tmp=0, zero=0] [L254] COND TRUE sb == 0 VAL [a=4294967295, b=0, ea=0, eb=0, ma=1, mb=0, one=0, r_mul=0, sb=0, tmp=0, zero=0] [L255] COND TRUE r_mul < a [L256] tmp___1 = -1 VAL [a=4294967295, b=0, ea=0, eb=0, ma=1, mb=0, one=0, r_mul=0, sb=0, tmp=0, tmp___1=-1, zero=0] [L266] CALL __VERIFIER_assert(tmp___1 == 0) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 1457 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1092 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 368 IncrementalHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 365 mSDtfsCounter, 368 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=6, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 536 ConstructedInterpolants, 0 QuantifiedInterpolants, 854 SizeOfPredicates, 12 NumberOfNonLiveVariables, 588 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 285/336 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-20 11:08:03,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...