/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_1-3a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 11:07:49,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 11:07:49,497 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:49,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 11:07:49,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 11:07:49,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 11:07:49,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 11:07:49,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 11:07:49,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 11:07:49,527 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 11:07:49,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 11:07:49,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 11:07:49,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 11:07:49,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 11:07:49,529 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 11:07:49,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 11:07:49,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 11:07:49,529 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 11:07:49,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 11:07:49,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 11:07:49,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 11:07:49,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 11:07:49,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 11:07:49,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 11:07:49,530 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 11:07:49,531 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 11:07:49,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 11:07:49,531 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 11:07:49,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 11:07:49,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 11:07:49,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 11:07:49,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 11:07:49,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 11:07:49,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 11:07:49,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 11:07:49,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 11:07:49,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 11:07:49,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 11:07:49,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 11:07:49,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 11:07:49,533 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 11:07:49,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 11:07:49,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 11:07:49,533 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:49,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 11:07:49,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 11:07:49,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 11:07:49,712 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 11:07:49,713 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 11:07:49,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_1-3a.c.cil.c [2023-12-20 11:07:50,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 11:07:50,850 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 11:07:50,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_1-3a.c.cil.c [2023-12-20 11:07:50,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916145712/777386601b1e40abbe48268fddfa4030/FLAG6b4c1889e [2023-12-20 11:07:50,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916145712/777386601b1e40abbe48268fddfa4030 [2023-12-20 11:07:50,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 11:07:50,870 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 11:07:50,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 11:07:50,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 11:07:50,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 11:07:50,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:07:50" (1/1) ... [2023-12-20 11:07:50,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ef6c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:50, skipping insertion in model container [2023-12-20 11:07:50,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:07:50" (1/1) ... [2023-12-20 11:07:50,921 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 11:07:51,035 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_1-3a.c.cil.c[730,743] [2023-12-20 11:07:51,078 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 11:07:51,089 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 11:07:51,099 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_1-3a.c.cil.c[730,743] [2023-12-20 11:07:51,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 11:07:51,138 INFO L206 MainTranslator]: Completed translation [2023-12-20 11:07:51,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:51 WrapperNode [2023-12-20 11:07:51,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 11:07:51,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 11:07:51,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 11:07:51,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 11:07:51,145 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:51" (1/1) ... [2023-12-20 11:07:51,160 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:51" (1/1) ... [2023-12-20 11:07:51,176 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 173 [2023-12-20 11:07:51,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 11:07:51,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 11:07:51,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 11:07:51,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 11:07:51,184 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:51" (1/1) ... [2023-12-20 11:07:51,184 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:51" (1/1) ... [2023-12-20 11:07:51,192 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:51" (1/1) ... [2023-12-20 11:07:51,210 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:51,210 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:51" (1/1) ... [2023-12-20 11:07:51,210 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:51" (1/1) ... [2023-12-20 11:07:51,213 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:51" (1/1) ... [2023-12-20 11:07:51,216 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:51" (1/1) ... [2023-12-20 11:07:51,216 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:51" (1/1) ... [2023-12-20 11:07:51,217 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:51" (1/1) ... [2023-12-20 11:07:51,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 11:07:51,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 11:07:51,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 11:07:51,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 11:07:51,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:51" (1/1) ... [2023-12-20 11:07:51,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 11:07:51,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:07:51,242 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:51,243 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:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 11:07:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 11:07:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-12-20 11:07:51,262 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-12-20 11:07:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 11:07:51,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 11:07:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-20 11:07:51,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-20 11:07:51,334 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 11:07:51,337 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 11:07:51,548 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 11:07:51,571 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 11:07:51,572 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-20 11:07:51,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:07:51 BoogieIcfgContainer [2023-12-20 11:07:51,572 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 11:07:51,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 11:07:51,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 11:07:51,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 11:07:51,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 11:07:50" (1/3) ... [2023-12-20 11:07:51,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7a1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:07:51, skipping insertion in model container [2023-12-20 11:07:51,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:07:51" (2/3) ... [2023-12-20 11:07:51,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7a1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:07:51, skipping insertion in model container [2023-12-20 11:07:51,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:07:51" (3/3) ... [2023-12-20 11:07:51,577 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2023-12-20 11:07:51,588 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 11:07:51,589 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 11:07:51,616 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 11:07:51,620 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;@260c2786, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 11:07:51,620 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 11:07:51,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 58 states have internal predecessors, (90), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-20 11:07:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-20 11:07:51,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:07:51,629 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:07:51,629 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:07:51,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:07:51,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1470327504, now seen corresponding path program 1 times [2023-12-20 11:07:51,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:07:51,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498587254] [2023-12-20 11:07:51,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:07:51,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:07:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:51,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 11:07:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:51,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 11:07:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:52,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 11:07:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:52,030 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-20 11:07:52,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:07:52,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498587254] [2023-12-20 11:07:52,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498587254] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:07:52,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524307999] [2023-12-20 11:07:52,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:07:52,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:07:52,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:07:52,038 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:07:52,040 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:07:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:52,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-20 11:07:52,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:07:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 11:07:52,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 11:07:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-20 11:07:52,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524307999] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 11:07:52,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 11:07:52,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 16 [2023-12-20 11:07:52,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651128429] [2023-12-20 11:07:52,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 11:07:52,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-20 11:07:52,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:07:52,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-20 11:07:52,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2023-12-20 11:07:52,375 INFO L87 Difference]: Start difference. First operand has 68 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 58 states have internal predecessors, (90), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-20 11:07:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:07:52,754 INFO L93 Difference]: Finished difference Result 188 states and 321 transitions. [2023-12-20 11:07:52,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-20 11:07:52,755 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2023-12-20 11:07:52,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:07:52,764 INFO L225 Difference]: With dead ends: 188 [2023-12-20 11:07:52,764 INFO L226 Difference]: Without dead ends: 119 [2023-12-20 11:07:52,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2023-12-20 11:07:52,770 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 116 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 11:07:52,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 943 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 11:07:52,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-20 11:07:52,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2023-12-20 11:07:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 84 states have internal predecessors, (120), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (17), 12 states have call predecessors, (17), 11 states have call successors, (17) [2023-12-20 11:07:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 149 transitions. [2023-12-20 11:07:52,805 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 149 transitions. Word has length 28 [2023-12-20 11:07:52,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:07:52,805 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 149 transitions. [2023-12-20 11:07:52,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-20 11:07:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 149 transitions. [2023-12-20 11:07:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-20 11:07:52,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:07:52,807 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-20 11:07:52,812 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:07:53,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-20 11:07:53,013 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:07:53,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:07:53,013 INFO L85 PathProgramCache]: Analyzing trace with hash -309833147, now seen corresponding path program 1 times [2023-12-20 11:07:53,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:07:53,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522638683] [2023-12-20 11:07:53,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:07:53,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:07:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:53,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 11:07:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:53,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 11:07:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:53,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 11:07:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-20 11:07:53,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:07:53,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522638683] [2023-12-20 11:07:53,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522638683] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:07:53,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577848405] [2023-12-20 11:07:53,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:07:53,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:07:53,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:07:53,163 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:07:53,182 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:07:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:53,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-20 11:07:53,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:07:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-20 11:07:53,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 11:07:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-20 11:07:53,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577848405] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 11:07:53,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 11:07:53,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 11] total 18 [2023-12-20 11:07:53,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625577264] [2023-12-20 11:07:53,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 11:07:53,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-20 11:07:53,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:07:53,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-20 11:07:53,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-20 11:07:53,507 INFO L87 Difference]: Start difference. First operand 98 states and 149 transitions. Second operand has 18 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-20 11:07:53,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:07:53,880 INFO L93 Difference]: Finished difference Result 206 states and 319 transitions. [2023-12-20 11:07:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-20 11:07:53,880 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 32 [2023-12-20 11:07:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:07:53,882 INFO L225 Difference]: With dead ends: 206 [2023-12-20 11:07:53,882 INFO L226 Difference]: Without dead ends: 142 [2023-12-20 11:07:53,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2023-12-20 11:07:53,883 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 356 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 11:07:53,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 823 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 11:07:53,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-20 11:07:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 98. [2023-12-20 11:07:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 84 states have internal predecessors, (116), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (17), 12 states have call predecessors, (17), 11 states have call successors, (17) [2023-12-20 11:07:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2023-12-20 11:07:53,892 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 32 [2023-12-20 11:07:53,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:07:53,893 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2023-12-20 11:07:53,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-20 11:07:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2023-12-20 11:07:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-20 11:07:53,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:07:53,894 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2023-12-20 11:07:53,907 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:07:54,099 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,SelfDestructingSolverStorable1 [2023-12-20 11:07:54,100 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:07:54,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:07:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash -131858523, now seen corresponding path program 1 times [2023-12-20 11:07:54,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:07:54,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241602998] [2023-12-20 11:07:54,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:07:54,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:07:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 11:07:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 11:07:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 11:07:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-20 11:07:54,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:07:54,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241602998] [2023-12-20 11:07:54,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241602998] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:07:54,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:07:54,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 11:07:54,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563282191] [2023-12-20 11:07:54,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:07:54,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 11:07:54,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:07:54,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 11:07:54,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:07:54,220 INFO L87 Difference]: Start difference. First operand 98 states and 145 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, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-20 11:07:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:07:54,265 INFO L93 Difference]: Finished difference Result 224 states and 337 transitions. [2023-12-20 11:07:54,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 11:07:54,266 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, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-12-20 11:07:54,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:07:54,268 INFO L225 Difference]: With dead ends: 224 [2023-12-20 11:07:54,269 INFO L226 Difference]: Without dead ends: 164 [2023-12-20 11:07:54,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:07:54,271 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:07:54,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 417 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:07:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-20 11:07:54,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2023-12-20 11:07:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 136 states have (on average 1.411764705882353) internal successors, (192), 139 states have internal predecessors, (192), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (24), 21 states have call predecessors, (24), 18 states have call successors, (24) [2023-12-20 11:07:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 235 transitions. [2023-12-20 11:07:54,285 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 235 transitions. Word has length 36 [2023-12-20 11:07:54,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:07:54,286 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 235 transitions. [2023-12-20 11:07:54,286 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, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-20 11:07:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 235 transitions. [2023-12-20 11:07:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-20 11:07:54,287 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:07:54,287 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2023-12-20 11:07:54,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 11:07:54,287 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:07:54,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:07:54,288 INFO L85 PathProgramCache]: Analyzing trace with hash 548199847, now seen corresponding path program 1 times [2023-12-20 11:07:54,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:07:54,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001636933] [2023-12-20 11:07:54,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:07:54,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:07:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 11:07:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 11:07:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 11:07:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-20 11:07:54,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:07:54,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001636933] [2023-12-20 11:07:54,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001636933] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:07:54,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:07:54,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 11:07:54,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376328695] [2023-12-20 11:07:54,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:07:54,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 11:07:54,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:07:54,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 11:07:54,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:07:54,361 INFO L87 Difference]: Start difference. First operand 160 states and 235 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-20 11:07:54,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:07:54,414 INFO L93 Difference]: Finished difference Result 208 states and 305 transitions. [2023-12-20 11:07:54,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 11:07:54,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-12-20 11:07:54,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:07:54,415 INFO L225 Difference]: With dead ends: 208 [2023-12-20 11:07:54,415 INFO L226 Difference]: Without dead ends: 154 [2023-12-20 11:07:54,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-20 11:07:54,416 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 37 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:07:54,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 490 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:07:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-20 11:07:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2023-12-20 11:07:54,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 129 states have (on average 1.3875968992248062) internal successors, (179), 132 states have internal predecessors, (179), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (21), 18 states have call predecessors, (21), 15 states have call successors, (21) [2023-12-20 11:07:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 216 transitions. [2023-12-20 11:07:54,423 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 216 transitions. Word has length 36 [2023-12-20 11:07:54,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:07:54,423 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 216 transitions. [2023-12-20 11:07:54,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-20 11:07:54,423 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 216 transitions. [2023-12-20 11:07:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-20 11:07:54,424 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:07:54,425 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-20 11:07:54,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 11:07:54,425 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:07:54,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:07:54,425 INFO L85 PathProgramCache]: Analyzing trace with hash 112369363, now seen corresponding path program 1 times [2023-12-20 11:07:54,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:07:54,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670076415] [2023-12-20 11:07:54,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:07:54,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:07:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 11:07:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 11:07:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 11:07:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 11:07:54,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:07:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670076415] [2023-12-20 11:07:54,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670076415] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:07:54,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:07:54,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 11:07:54,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716649199] [2023-12-20 11:07:54,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:07:54,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 11:07:54,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:07:54,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 11:07:54,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 11:07:54,459 INFO L87 Difference]: Start difference. First operand 150 states and 216 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-20 11:07:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:07:54,477 INFO L93 Difference]: Finished difference Result 198 states and 288 transitions. [2023-12-20 11:07:54,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 11:07:54,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2023-12-20 11:07:54,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:07:54,491 INFO L225 Difference]: With dead ends: 198 [2023-12-20 11:07:54,491 INFO L226 Difference]: Without dead ends: 156 [2023-12-20 11:07:54,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:07:54,492 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 47 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:07:54,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 286 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:07:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-20 11:07:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 130. [2023-12-20 11:07:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 113 states have (on average 1.345132743362832) internal successors, (152), 114 states have internal predecessors, (152), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (17), 14 states have call predecessors, (17), 11 states have call successors, (17) [2023-12-20 11:07:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 181 transitions. [2023-12-20 11:07:54,498 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 181 transitions. Word has length 38 [2023-12-20 11:07:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:07:54,498 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 181 transitions. [2023-12-20 11:07:54,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-20 11:07:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 181 transitions. [2023-12-20 11:07:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-20 11:07:54,499 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:07:54,499 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-20 11:07:54,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 11:07:54,500 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:07:54,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:07:54,500 INFO L85 PathProgramCache]: Analyzing trace with hash 869887198, now seen corresponding path program 1 times [2023-12-20 11:07:54,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:07:54,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43787859] [2023-12-20 11:07:54,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:07:54,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:07:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 11:07:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 11:07:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 11:07:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 11:07:54,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:07:54,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43787859] [2023-12-20 11:07:54,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43787859] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:07:54,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:07:54,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 11:07:54,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90302838] [2023-12-20 11:07:54,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:07:54,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 11:07:54,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:07:54,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 11:07:54,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 11:07:54,532 INFO L87 Difference]: Start difference. First operand 130 states and 181 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-20 11:07:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:07:54,546 INFO L93 Difference]: Finished difference Result 147 states and 202 transitions. [2023-12-20 11:07:54,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 11:07:54,547 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-12-20 11:07:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:07:54,548 INFO L225 Difference]: With dead ends: 147 [2023-12-20 11:07:54,548 INFO L226 Difference]: Without dead ends: 140 [2023-12-20 11:07:54,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:07:54,548 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 17 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:07:54,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 287 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:07:54,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-20 11:07:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2023-12-20 11:07:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 118 states have internal predecessors, (156), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (17), 14 states have call predecessors, (17), 11 states have call successors, (17) [2023-12-20 11:07:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 185 transitions. [2023-12-20 11:07:54,553 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 185 transitions. Word has length 39 [2023-12-20 11:07:54,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:07:54,553 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 185 transitions. [2023-12-20 11:07:54,553 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-20 11:07:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 185 transitions. [2023-12-20 11:07:54,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-20 11:07:54,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:07:54,554 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-20 11:07:54,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 11:07:54,555 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:07:54,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:07:54,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1650072736, now seen corresponding path program 1 times [2023-12-20 11:07:54,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:07:54,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020317199] [2023-12-20 11:07:54,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:07:54,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:07:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 11:07:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 11:07:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 11:07:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 11:07:54,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:07:54,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020317199] [2023-12-20 11:07:54,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020317199] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:07:54,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:07:54,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 11:07:54,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691069686] [2023-12-20 11:07:54,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:07:54,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 11:07:54,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:07:54,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 11:07:54,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 11:07:54,606 INFO L87 Difference]: Start difference. First operand 134 states and 185 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-20 11:07:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:07:54,624 INFO L93 Difference]: Finished difference Result 141 states and 191 transitions. [2023-12-20 11:07:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 11:07:54,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-12-20 11:07:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:07:54,625 INFO L225 Difference]: With dead ends: 141 [2023-12-20 11:07:54,625 INFO L226 Difference]: Without dead ends: 134 [2023-12-20 11:07:54,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:07:54,626 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 5 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:07:54,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 369 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:07:54,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-20 11:07:54,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2023-12-20 11:07:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 113 states have (on average 1.3185840707964602) internal successors, (149), 114 states have internal predecessors, (149), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (17), 14 states have call predecessors, (17), 11 states have call successors, (17) [2023-12-20 11:07:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 178 transitions. [2023-12-20 11:07:54,631 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 178 transitions. Word has length 39 [2023-12-20 11:07:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:07:54,631 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 178 transitions. [2023-12-20 11:07:54,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-20 11:07:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 178 transitions. [2023-12-20 11:07:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-20 11:07:54,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:07:54,632 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:07:54,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 11:07:54,632 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:07:54,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:07:54,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1344065220, now seen corresponding path program 1 times [2023-12-20 11:07:54,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:07:54,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044115108] [2023-12-20 11:07:54,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:07:54,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:07:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 11:07:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 11:07:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 11:07:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:07:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 11:07:54,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:07:54,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044115108] [2023-12-20 11:07:54,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044115108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:07:54,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:07:54,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 11:07:54,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053627318] [2023-12-20 11:07:54,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:07:54,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 11:07:54,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:07:54,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 11:07:54,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 11:07:54,666 INFO L87 Difference]: Start difference. First operand 130 states and 178 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-20 11:07:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:07:54,686 INFO L93 Difference]: Finished difference Result 207 states and 288 transitions. [2023-12-20 11:07:54,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 11:07:54,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-12-20 11:07:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:07:54,688 INFO L225 Difference]: With dead ends: 207 [2023-12-20 11:07:54,688 INFO L226 Difference]: Without dead ends: 167 [2023-12-20 11:07:54,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:07:54,688 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 76 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:07:54,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 289 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:07:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-20 11:07:54,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2023-12-20 11:07:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 states have internal predecessors, (159), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (18), 15 states have call predecessors, (18), 12 states have call successors, (18) [2023-12-20 11:07:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 190 transitions. [2023-12-20 11:07:54,693 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 190 transitions. Word has length 40 [2023-12-20 11:07:54,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:07:54,693 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 190 transitions. [2023-12-20 11:07:54,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-20 11:07:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 190 transitions. [2023-12-20 11:07:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-20 11:07:54,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:07:54,694 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-12-20 11:07:54,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 11:07:54,694 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:07:54,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:07:54,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1640633178, now seen corresponding path program 2 times [2023-12-20 11:07:54,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:07:54,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48218977] [2023-12-20 11:07:54,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:07:54,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:07:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 11:07:54,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 11:07:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 11:07:54,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 11:07:54,732 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 11:07:54,732 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 11:07:54,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 11:07:54,735 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:07:54,737 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 11:07:54,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 11:07:54 BoogieIcfgContainer [2023-12-20 11:07:54,757 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 11:07:54,757 INFO L158 Benchmark]: Toolchain (without parser) took 3887.22ms. Allocated memory was 220.2MB in the beginning and 306.2MB in the end (delta: 86.0MB). Free memory was 166.9MB in the beginning and 198.7MB in the end (delta: -31.8MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2023-12-20 11:07:54,758 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 220.2MB. Free memory is still 167.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 11:07:54,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.55ms. Allocated memory is still 220.2MB. Free memory was 166.6MB in the beginning and 152.6MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-20 11:07:54,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.63ms. Allocated memory is still 220.2MB. Free memory was 152.6MB in the beginning and 150.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 11:07:54,758 INFO L158 Benchmark]: Boogie Preprocessor took 42.01ms. Allocated memory is still 220.2MB. Free memory was 150.5MB in the beginning and 148.1MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 11:07:54,758 INFO L158 Benchmark]: RCFGBuilder took 352.64ms. Allocated memory is still 220.2MB. Free memory was 148.1MB in the beginning and 180.8MB in the end (delta: -32.8MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. [2023-12-20 11:07:54,758 INFO L158 Benchmark]: TraceAbstraction took 3183.78ms. Allocated memory was 220.2MB in the beginning and 306.2MB in the end (delta: 86.0MB). Free memory was 180.3MB in the beginning and 198.7MB in the end (delta: -18.4MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. [2023-12-20 11:07:54,759 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.42ms. Allocated memory is still 220.2MB. Free memory is still 167.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.55ms. Allocated memory is still 220.2MB. Free memory was 166.6MB in the beginning and 152.6MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.63ms. Allocated memory is still 220.2MB. Free memory was 152.6MB in the beginning and 150.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.01ms. Allocated memory is still 220.2MB. Free memory was 150.5MB in the beginning and 148.1MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 352.64ms. Allocated memory is still 220.2MB. Free memory was 148.1MB in the beginning and 180.8MB in the end (delta: -32.8MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. * TraceAbstraction took 3183.78ms. Allocated memory was 220.2MB in the beginning and 306.2MB in the end (delta: 86.0MB). Free memory was 180.3MB in the beginning and 198.7MB in the end (delta: -18.4MB). Peak memory consumption was 67.1MB. 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 108. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=0, eb=0] [L251] 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); [L251] RET, EXPR base2flt(0, 0) VAL [ea=0, eb=0] [L251] zero = base2flt(0, 0) [L252] 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=1, e=0, m=2, res=1] [L80] return (__retres4); [L252] RET, EXPR base2flt(ma, ea) VAL [ea=0, eb=0, ma=1, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) 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); [L253] RET, EXPR base2flt(mb, eb) VAL [a=1, ea=0, eb=0, ma=1, mb=1, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=1, b=4294967295, ea=0, eb=0, ma=1, mb=1, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=1, b=4294967295, ea=0, eb=0, ma=1, mb=1, tmp=1, zero=0] [L263] sa = tmp VAL [a=1, b=4294967295, ea=0, eb=0, ma=1, mb=1, sa=1, tmp=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=1, b=4294967295, ea=0, eb=0, ma=1, mb=1, sa=1, tmp=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=1, b=4294967295, ea=0, eb=0, ma=1, mb=1, sa=1, tmp=1, tmp___0=1, zero=0] [L273] sb = tmp___0 VAL [a=1, b=4294967295, ea=0, eb=0, ma=1, mb=1, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=1, \old(b)=4294967295, a=1, b=4294967295] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=1, \old(b)=4294967295, a=4294967295, b=1, tmp=1] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) [L114] CALL __VERIFIER_assert(ea >= eb) 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, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 718 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 703 mSDsluCounter, 3904 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3172 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 961 IncrementalHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 732 mSDtfsCounter, 961 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=3, InterpolantAutomatonStates: 69, 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, 8 MinimizatonAttempts, 137 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 396 ConstructedInterpolants, 0 QuantifiedInterpolants, 710 SizeOfPredicates, 9 NumberOfNonLiveVariables, 254 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 118/144 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:07:54,772 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...