/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_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/lcm1_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 17:06:51,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 17:06:51,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 17:06:51,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 17:06:51,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 17:06:51,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 17:06:51,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 17:06:51,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 17:06:51,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 17:06:51,125 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 17:06:51,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 17:06:51,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 17:06:51,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 17:06:51,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 17:06:51,127 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 17:06:51,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 17:06:51,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 17:06:51,128 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 17:06:51,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 17:06:51,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 17:06:51,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 17:06:51,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 17:06:51,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 17:06:51,129 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 17:06:51,129 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 17:06:51,130 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 17:06:51,130 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 17:06:51,130 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 17:06:51,130 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 17:06:51,130 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 17:06:51,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 17:06:51,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 17:06:51,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 17:06:51,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 17:06:51,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:06:51,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 17:06:51,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 17:06:51,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 17:06:51,132 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 17:06:51,132 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 17:06:51,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 17:06:51,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 17:06:51,132 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 17:06:51,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 17:06:51,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 17:06:51,133 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 17:06:51,133 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 [2023-12-16 17:06:51,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 17:06:51,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 17:06:51,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 17:06:51,333 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 17:06:51,333 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 17:06:51,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm1_valuebound2.c [2023-12-16 17:06:52,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 17:06:52,425 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 17:06:52,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm1_valuebound2.c [2023-12-16 17:06:52,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03037fc69/61338945b1e44ed68cd146575285476e/FLAGed73d1d42 [2023-12-16 17:06:52,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03037fc69/61338945b1e44ed68cd146575285476e [2023-12-16 17:06:52,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 17:06:52,446 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 17:06:52,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 17:06:52,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 17:06:52,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 17:06:52,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:06:52" (1/1) ... [2023-12-16 17:06:52,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b866ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:06:52, skipping insertion in model container [2023-12-16 17:06:52,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:06:52" (1/1) ... [2023-12-16 17:06:52,469 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 17:06:52,592 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm1_valuebound2.c[552,565] [2023-12-16 17:06:52,602 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:06:52,610 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 17:06:52,619 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm1_valuebound2.c[552,565] [2023-12-16 17:06:52,624 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:06:52,633 INFO L206 MainTranslator]: Completed translation [2023-12-16 17:06:52,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:06:52 WrapperNode [2023-12-16 17:06:52,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 17:06:52,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 17:06:52,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 17:06:52,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 17:06:52,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:06:52" (1/1) ... [2023-12-16 17:06:52,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:06:52" (1/1) ... [2023-12-16 17:06:52,659 INFO L138 Inliner]: procedures = 14, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2023-12-16 17:06:52,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 17:06:52,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 17:06:52,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 17:06:52,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 17:06:52,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:06:52" (1/1) ... [2023-12-16 17:06:52,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:06:52" (1/1) ... [2023-12-16 17:06:52,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:06:52" (1/1) ... [2023-12-16 17:06:52,678 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2023-12-16 17:06:52,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:06:52" (1/1) ... [2023-12-16 17:06:52,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:06:52" (1/1) ... [2023-12-16 17:06:52,681 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:06:52" (1/1) ... [2023-12-16 17:06:52,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:06:52" (1/1) ... [2023-12-16 17:06:52,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:06:52" (1/1) ... [2023-12-16 17:06:52,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:06:52" (1/1) ... [2023-12-16 17:06:52,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 17:06:52,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 17:06:52,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 17:06:52,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 17:06:52,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:06:52" (1/1) ... [2023-12-16 17:06:52,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:06:52,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:06:52,715 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-16 17:06:52,731 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-16 17:06:52,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 17:06:52,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 17:06:52,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 17:06:52,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 17:06:52,737 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 17:06:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 17:06:52,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 17:06:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 17:06:52,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 17:06:52,781 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 17:06:52,783 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 17:06:52,911 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 17:06:52,934 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 17:06:52,934 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-16 17:06:52,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:06:52 BoogieIcfgContainer [2023-12-16 17:06:52,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 17:06:52,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 17:06:52,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 17:06:52,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 17:06:52,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:06:52" (1/3) ... [2023-12-16 17:06:52,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8defd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:06:52, skipping insertion in model container [2023-12-16 17:06:52,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:06:52" (2/3) ... [2023-12-16 17:06:52,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8defd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:06:52, skipping insertion in model container [2023-12-16 17:06:52,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:06:52" (3/3) ... [2023-12-16 17:06:52,940 INFO L112 eAbstractionObserver]: Analyzing ICFG lcm1_valuebound2.c [2023-12-16 17:06:52,951 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 17:06:52,951 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 17:06:52,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 17:06:52,983 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;@5b053e90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 17:06:52,983 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 17:06:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 18 states have internal predecessors, (29), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 17:06:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 17:06:52,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:06:52,991 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:06:52,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:06:52,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:06:52,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1357102633, now seen corresponding path program 1 times [2023-12-16 17:06:53,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:06:53,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514365524] [2023-12-16 17:06:53,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:06:53,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:06:53,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:06:53,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:06:53,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 17:06:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:06:53,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 17:06:53,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:06:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-16 17:06:53,166 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:06:53,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:06:53,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514365524] [2023-12-16 17:06:53,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514365524] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:06:53,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:06:53,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:06:53,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458861405] [2023-12-16 17:06:53,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:06:53,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 17:06:53,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:06:53,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 17:06:53,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 17:06:53,196 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 18 states have internal predecessors, (29), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 17:06:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:06:53,224 INFO L93 Difference]: Finished difference Result 62 states and 110 transitions. [2023-12-16 17:06:53,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 17:06:53,225 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2023-12-16 17:06:53,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:06:53,229 INFO L225 Difference]: With dead ends: 62 [2023-12-16 17:06:53,229 INFO L226 Difference]: Without dead ends: 30 [2023-12-16 17:06:53,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 17:06:53,235 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:06:53,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:06:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-16 17:06:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-16 17:06:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 17:06:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2023-12-16 17:06:53,268 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 38 [2023-12-16 17:06:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:06:53,269 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2023-12-16 17:06:53,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 17:06:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2023-12-16 17:06:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 17:06:53,271 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:06:53,271 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:06:53,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 17:06:53,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:06:53,474 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:06:53,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:06:53,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1327714723, now seen corresponding path program 1 times [2023-12-16 17:06:53,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:06:53,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455876032] [2023-12-16 17:06:53,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:06:53,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:06:53,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:06:53,487 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:06:53,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 17:06:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:06:53,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 17:06:53,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:06:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-16 17:06:53,906 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:06:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 17:06:54,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:06:54,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455876032] [2023-12-16 17:06:54,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455876032] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 17:06:54,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 17:06:54,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2023-12-16 17:06:54,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497620481] [2023-12-16 17:06:54,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:06:54,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:06:54,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:06:54,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:06:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-12-16 17:06:54,616 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 17:07:00,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-16 17:07:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:07:00,466 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2023-12-16 17:07:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:07:00,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2023-12-16 17:07:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:07:00,472 INFO L225 Difference]: With dead ends: 47 [2023-12-16 17:07:00,472 INFO L226 Difference]: Without dead ends: 45 [2023-12-16 17:07:00,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-12-16 17:07:00,474 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-16 17:07:00,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 111 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2023-12-16 17:07:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-16 17:07:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2023-12-16 17:07:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-16 17:07:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2023-12-16 17:07:00,483 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 38 [2023-12-16 17:07:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:07:00,483 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2023-12-16 17:07:00,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 17:07:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2023-12-16 17:07:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-16 17:07:00,484 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:07:00,484 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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-16 17:07:00,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 17:07:00,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:07:00,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:07:00,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:07:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1872990873, now seen corresponding path program 1 times [2023-12-16 17:07:00,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:07:00,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524644373] [2023-12-16 17:07:00,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:07:00,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:07:00,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:07:00,690 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:07:00,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 17:07:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:07:00,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 17:07:00,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:07:01,092 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-16 17:07:01,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:07:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 17:07:07,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:07:07,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524644373] [2023-12-16 17:07:07,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524644373] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 17:07:07,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 17:07:07,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2023-12-16 17:07:07,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312437764] [2023-12-16 17:07:07,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:07:07,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 17:07:07,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:07:07,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 17:07:07,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-16 17:07:07,238 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 17:07:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:07:08,934 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2023-12-16 17:07:08,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 17:07:08,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2023-12-16 17:07:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:07:08,942 INFO L225 Difference]: With dead ends: 60 [2023-12-16 17:07:08,942 INFO L226 Difference]: Without dead ends: 58 [2023-12-16 17:07:08,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2023-12-16 17:07:08,943 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 9 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 17:07:08,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 153 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 17:07:08,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-16 17:07:08,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2023-12-16 17:07:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 36 states have internal predecessors, (44), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 17:07:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2023-12-16 17:07:08,953 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 44 [2023-12-16 17:07:08,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:07:08,953 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2023-12-16 17:07:08,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 17:07:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2023-12-16 17:07:08,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-16 17:07:08,955 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:07:08,955 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 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-16 17:07:08,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 17:07:09,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:07:09,161 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:07:09,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:07:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash 503918134, now seen corresponding path program 1 times [2023-12-16 17:07:09,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:07:09,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791511817] [2023-12-16 17:07:09,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:07:09,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:07:09,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:07:09,163 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:07:09,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 17:07:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:07:09,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:07:09,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:07:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-16 17:07:09,258 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:07:09,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:07:09,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791511817] [2023-12-16 17:07:09,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791511817] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:07:09,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:07:09,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:07:09,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008439396] [2023-12-16 17:07:09,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:07:09,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:07:09,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:07:09,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:07:09,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:07:09,265 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 17:07:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:07:09,480 INFO L93 Difference]: Finished difference Result 63 states and 84 transitions. [2023-12-16 17:07:09,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:07:09,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2023-12-16 17:07:09,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:07:09,481 INFO L225 Difference]: With dead ends: 63 [2023-12-16 17:07:09,482 INFO L226 Difference]: Without dead ends: 51 [2023-12-16 17:07:09,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 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-16 17:07:09,482 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 5 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:07:09,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 145 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:07:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-16 17:07:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-16 17:07:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 17:07:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2023-12-16 17:07:09,491 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 49 [2023-12-16 17:07:09,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:07:09,491 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2023-12-16 17:07:09,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 17:07:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2023-12-16 17:07:09,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-16 17:07:09,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:07:09,492 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 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] [2023-12-16 17:07:09,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 17:07:09,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:07:09,695 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:07:09,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:07:09,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1337767222, now seen corresponding path program 1 times [2023-12-16 17:07:09,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:07:09,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970840768] [2023-12-16 17:07:09,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:07:09,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:07:09,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:07:09,700 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:07:09,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 17:07:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:07:09,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 17:07:09,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:07:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 17:07:10,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:07:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-16 17:07:12,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:07:12,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970840768] [2023-12-16 17:07:12,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970840768] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 17:07:12,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 17:07:12,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2023-12-16 17:07:12,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802924220] [2023-12-16 17:07:12,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:07:12,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 17:07:12,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:07:12,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 17:07:12,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-12-16 17:07:12,707 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 17:07:17,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:07:21,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:07:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:07:22,796 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2023-12-16 17:07:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 17:07:22,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2023-12-16 17:07:22,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:07:22,803 INFO L225 Difference]: With dead ends: 85 [2023-12-16 17:07:22,803 INFO L226 Difference]: Without dead ends: 83 [2023-12-16 17:07:22,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-12-16 17:07:22,804 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:07:22,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 142 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2023-12-16 17:07:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-16 17:07:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2023-12-16 17:07:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 53 states have internal predecessors, (68), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 17:07:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2023-12-16 17:07:22,819 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 52 [2023-12-16 17:07:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:07:22,819 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2023-12-16 17:07:22,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 17:07:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2023-12-16 17:07:22,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 17:07:22,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:07:22,820 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:07:22,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-16 17:07:23,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:07:23,027 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:07:23,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:07:23,028 INFO L85 PathProgramCache]: Analyzing trace with hash -354361820, now seen corresponding path program 1 times [2023-12-16 17:07:23,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:07:23,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484159769] [2023-12-16 17:07:23,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:07:23,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:07:23,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:07:23,030 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:07:23,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 17:07:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:07:23,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 17:07:23,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:07:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-16 17:07:23,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:07:25,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:07:25,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484159769] [2023-12-16 17:07:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484159769] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:07:25,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [530154075] [2023-12-16 17:07:25,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:07:25,614 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:07:25,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:07:25,657 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:07:25,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-16 17:07:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:07:25,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 17:07:25,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:07:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-16 17:07:25,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:07:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-16 17:07:28,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [530154075] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 17:07:28,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:07:28,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 6] total 19 [2023-12-16 17:07:28,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501696312] [2023-12-16 17:07:28,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:07:28,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:07:28,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:07:28,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:07:28,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2023-12-16 17:07:28,865 INFO L87 Difference]: Start difference. First operand 82 states and 117 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-16 17:07:33,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:07:34,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:07:34,254 INFO L93 Difference]: Finished difference Result 107 states and 152 transitions. [2023-12-16 17:07:34,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:07:34,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2023-12-16 17:07:34,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:07:34,260 INFO L225 Difference]: With dead ends: 107 [2023-12-16 17:07:34,260 INFO L226 Difference]: Without dead ends: 105 [2023-12-16 17:07:34,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-12-16 17:07:34,261 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:07:34,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 104 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2023-12-16 17:07:34,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-16 17:07:34,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2023-12-16 17:07:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 68 states have internal predecessors, (88), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 17:07:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2023-12-16 17:07:34,294 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 59 [2023-12-16 17:07:34,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:07:34,294 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2023-12-16 17:07:34,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-16 17:07:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2023-12-16 17:07:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-16 17:07:34,318 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:07:34,318 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:07:34,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 17:07:34,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-16 17:07:34,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 17:07:34,719 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:07:34,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:07:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1482847621, now seen corresponding path program 1 times [2023-12-16 17:07:34,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:07:34,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458308005] [2023-12-16 17:07:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:07:34,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:07:34,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:07:34,722 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:07:34,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 17:07:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:07:34,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 17:07:34,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:07:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 13 proven. 27 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-16 17:07:34,996 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:07:35,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:07:35,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458308005] [2023-12-16 17:07:35,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458308005] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:07:35,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [837408285] [2023-12-16 17:07:35,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:07:35,313 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:07:35,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:07:35,323 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:07:35,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-16 17:07:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:07:35,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 17:07:35,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:07:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-16 17:07:35,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:07:35,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [837408285] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:07:35,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:07:35,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-12-16 17:07:35,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737521028] [2023-12-16 17:07:35,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:07:35,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 17:07:35,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:07:35,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 17:07:35,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-12-16 17:07:35,909 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 10 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 8 states have call predecessors, (18), 9 states have call successors, (18) [2023-12-16 17:07:36,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:07:36,223 INFO L93 Difference]: Finished difference Result 136 states and 188 transitions. [2023-12-16 17:07:36,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 17:07:36,224 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 10 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 8 states have call predecessors, (18), 9 states have call successors, (18) Word has length 66 [2023-12-16 17:07:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:07:36,224 INFO L225 Difference]: With dead ends: 136 [2023-12-16 17:07:36,225 INFO L226 Difference]: Without dead ends: 56 [2023-12-16 17:07:36,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2023-12-16 17:07:36,226 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:07:36,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 211 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:07:36,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-16 17:07:36,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2023-12-16 17:07:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 17:07:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2023-12-16 17:07:36,234 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 66 [2023-12-16 17:07:36,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:07:36,234 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2023-12-16 17:07:36,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 10 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 8 states have call predecessors, (18), 9 states have call successors, (18) [2023-12-16 17:07:36,234 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2023-12-16 17:07:36,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 17:07:36,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:07:36,235 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:07:36,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 17:07:36,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2023-12-16 17:07:36,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 17:07:36,640 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:07:36,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:07:36,640 INFO L85 PathProgramCache]: Analyzing trace with hash -867442621, now seen corresponding path program 1 times [2023-12-16 17:07:36,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:07:36,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470028696] [2023-12-16 17:07:36,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:07:36,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:07:36,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:07:36,642 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:07:36,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 17:07:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:07:36,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-16 17:07:36,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:07:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-16 17:07:39,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:07:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-12-16 17:07:47,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:07:47,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470028696] [2023-12-16 17:07:47,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470028696] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:07:47,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:07:47,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 21 [2023-12-16 17:07:47,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628792124] [2023-12-16 17:07:47,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:07:47,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-16 17:07:47,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:07:47,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-16 17:07:47,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2023-12-16 17:07:47,003 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 21 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 12 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2023-12-16 17:07:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:07:50,174 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2023-12-16 17:07:50,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 17:07:50,181 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 12 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 72 [2023-12-16 17:07:50,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:07:50,181 INFO L225 Difference]: With dead ends: 95 [2023-12-16 17:07:50,181 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 17:07:50,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2023-12-16 17:07:50,182 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:07:50,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 205 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-16 17:07:50,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 17:07:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 17:07:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:07:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 17:07:50,183 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2023-12-16 17:07:50,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:07:50,183 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 17:07:50,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 12 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2023-12-16 17:07:50,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 17:07:50,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 17:07:50,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 17:07:50,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-16 17:07:50,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:07:50,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 17:08:00,053 INFO L895 garLoopResultBuilder]: At program point L40-2(lines 40 60) the Hoare annotation is: (and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~x~0#1|) (= (bvmul |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|) (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~u~0#1|)))) [2023-12-16 17:08:00,053 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (and (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))) [2023-12-16 17:08:00,054 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) [2023-12-16 17:08:00,054 INFO L895 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (and (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) [2023-12-16 17:08:00,054 INFO L895 garLoopResultBuilder]: At program point L53-1(lines 53 59) the Hoare annotation is: (let ((.cse1 (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32))) (.cse2 (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) (.cse3 (bvmul |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse0 (bvadd |ULTIMATE.start_main_~x~0#1| (bvmul (_ bv4294967295 32) (bvneg |ULTIMATE.start_main_~y~0#1|))))) (and (bvugt .cse0 |ULTIMATE.start_main_~y~0#1|) (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) .cse1 (bvule .cse0 (_ bv2 32)) .cse2 (bvuge |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) (= .cse3 (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~u~0#1|))))) (and (= |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~b~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~x~0#1|)) (bvuge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse1 .cse2 (not (bvugt |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (forall ((|ULTIMATE.start_main_~y~0#1| (_ BitVec 32))) (= .cse3 (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~u~0#1|))))))) [2023-12-16 17:08:00,054 INFO L895 garLoopResultBuilder]: At program point L53-2(lines 40 60) the Hoare annotation is: (let ((.cse1 (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32))) (.cse2 (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) (.cse3 (bvuge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))) (.cse4 (bvmul |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse0 (bvadd |ULTIMATE.start_main_~x~0#1| (bvmul (_ bv4294967295 32) (bvneg |ULTIMATE.start_main_~y~0#1|))))) (and (bvugt .cse0 |ULTIMATE.start_main_~y~0#1|) (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) .cse1 (bvule .cse0 (_ bv2 32)) .cse2 .cse3 (= .cse4 (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~u~0#1|))))) (and (= |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~b~0#1|) (bvuge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse1 (bvule |ULTIMATE.start_main_~x~0#1| (_ bv2 32)) .cse2 .cse3 (forall ((|ULTIMATE.start_main_~y~0#1| (_ BitVec 32))) (= .cse4 (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~u~0#1|))))))) [2023-12-16 17:08:00,054 INFO L895 garLoopResultBuilder]: At program point L45-2(lines 45 51) the Hoare annotation is: (let ((.cse1 (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32))) (.cse2 (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) (.cse3 (bvuge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))) (.cse4 (bvmul |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse0 (bvadd |ULTIMATE.start_main_~x~0#1| (bvmul (_ bv4294967295 32) (bvneg |ULTIMATE.start_main_~y~0#1|))))) (and (bvugt .cse0 |ULTIMATE.start_main_~y~0#1|) (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) .cse1 (bvule .cse0 (_ bv2 32)) .cse2 .cse3 (= .cse4 (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~u~0#1|))))) (and (= |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~b~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~x~0#1|)) (bvuge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse1 (bvule |ULTIMATE.start_main_~x~0#1| (_ bv2 32)) .cse2 .cse3 (forall ((|ULTIMATE.start_main_~y~0#1| (_ BitVec 32))) (= .cse4 (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~u~0#1|))))))) [2023-12-16 17:08:00,055 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse1 (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32))) (.cse2 (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) (.cse3 (bvuge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))) (.cse4 (bvmul |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse0 (bvadd |ULTIMATE.start_main_~x~0#1| (bvmul (_ bv4294967295 32) (bvneg |ULTIMATE.start_main_~y~0#1|))))) (and (bvugt .cse0 |ULTIMATE.start_main_~y~0#1|) (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) .cse1 (bvule .cse0 (_ bv2 32)) .cse2 .cse3 (= .cse4 (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~u~0#1|))))) (and (= |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~b~0#1|) (bvuge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse1 (bvule |ULTIMATE.start_main_~x~0#1| (_ bv2 32)) .cse2 .cse3 (forall ((|ULTIMATE.start_main_~y~0#1| (_ BitVec 32))) (= .cse4 (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~u~0#1|))))))) [2023-12-16 17:08:00,055 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 40 60) no Hoare annotation was computed. [2023-12-16 17:08:00,055 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2023-12-16 17:08:00,055 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 17:08:00,055 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~x~0#1|) [2023-12-16 17:08:00,055 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) [2023-12-16 17:08:00,055 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse1 (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32))) (.cse2 (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) (.cse3 (bvmul |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse0 (bvadd |ULTIMATE.start_main_~x~0#1| (bvmul (_ bv4294967295 32) (bvneg |ULTIMATE.start_main_~y~0#1|))))) (and (bvugt .cse0 |ULTIMATE.start_main_~y~0#1|) (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) .cse1 (bvule .cse0 (_ bv2 32)) .cse2 (bvuge |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) (= .cse3 (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~u~0#1|))))) (and (= |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~b~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~x~0#1|)) (bvuge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse1 .cse2 (not (bvugt |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (forall ((|ULTIMATE.start_main_~y~0#1| (_ BitVec 32))) (= .cse3 (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~u~0#1|))))))) [2023-12-16 17:08:00,055 INFO L899 garLoopResultBuilder]: For program point L54-1(lines 53 59) no Hoare annotation was computed. [2023-12-16 17:08:00,055 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse1 (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32))) (.cse2 (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) (.cse3 (bvuge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))) (.cse4 (bvmul |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse0 (bvadd |ULTIMATE.start_main_~x~0#1| (bvmul (_ bv4294967295 32) (bvneg |ULTIMATE.start_main_~y~0#1|))))) (and (bvugt .cse0 |ULTIMATE.start_main_~y~0#1|) (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) .cse1 (bvule .cse0 (_ bv2 32)) .cse2 .cse3 (= .cse4 (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~u~0#1|))))) (and (= |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~b~0#1|) (not (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~x~0#1|)) (bvuge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse1 (bvule |ULTIMATE.start_main_~x~0#1| (_ bv2 32)) .cse2 .cse3 (forall ((|ULTIMATE.start_main_~y~0#1| (_ BitVec 32))) (= .cse4 (bvadd (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~v~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~u~0#1|))))))) [2023-12-16 17:08:00,055 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 45 51) no Hoare annotation was computed. [2023-12-16 17:08:00,055 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 17:08:00,055 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-12-16 17:08:00,056 INFO L895 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: (and (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv1 32)) (bvule |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))) [2023-12-16 17:08:00,056 INFO L902 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2023-12-16 17:08:00,056 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2023-12-16 17:08:00,056 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-12-16 17:08:00,056 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2023-12-16 17:08:00,056 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 13) the Hoare annotation is: true [2023-12-16 17:08:00,056 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2023-12-16 17:08:00,056 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-12-16 17:08:00,056 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-12-16 17:08:00,056 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-12-16 17:08:00,056 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-12-16 17:08:00,056 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-12-16 17:08:00,056 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-12-16 17:08:00,058 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:08:00,059 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 17:08:00,069 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall ULTIMATE.start_main_~y~0#1 : bv32 :: ~bvmul~32(~b~0, ~a~0) == ~bvadd~32(~bvmul~32(ULTIMATE.start_main_~y~0#1, ~v~0), ~bvmul~32(~x~0, ~u~0))) could not be translated [2023-12-16 17:08:00,070 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall ULTIMATE.start_main_~y~0#1 : bv32 :: ~bvmul~32(~b~0, ~a~0) == ~bvadd~32(~bvmul~32(ULTIMATE.start_main_~y~0#1, ~v~0), ~bvmul~32(~x~0, ~u~0))) could not be translated [2023-12-16 17:08:00,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall ULTIMATE.start_main_~y~0#1 : bv32 :: ~bvmul~32(~b~0, ~a~0) == ~bvadd~32(~bvmul~32(ULTIMATE.start_main_~y~0#1, ~v~0), ~bvmul~32(~x~0, ~u~0))) could not be translated [2023-12-16 17:08:00,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:08:00 BoogieIcfgContainer [2023-12-16 17:08:00,072 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 17:08:00,072 INFO L158 Benchmark]: Toolchain (without parser) took 67626.09ms. Allocated memory is still 246.4MB. Free memory was 205.7MB in the beginning and 155.1MB in the end (delta: 50.6MB). Peak memory consumption was 136.6MB. Max. memory is 8.0GB. [2023-12-16 17:08:00,072 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 195.0MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 17:08:00,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.83ms. Allocated memory is still 246.4MB. Free memory was 205.4MB in the beginning and 193.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 17:08:00,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.31ms. Allocated memory is still 246.4MB. Free memory was 193.8MB in the beginning and 192.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 17:08:00,073 INFO L158 Benchmark]: Boogie Preprocessor took 25.98ms. Allocated memory is still 246.4MB. Free memory was 192.1MB in the beginning and 190.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 17:08:00,073 INFO L158 Benchmark]: RCFGBuilder took 247.92ms. Allocated memory is still 246.4MB. Free memory was 190.0MB in the beginning and 176.7MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 17:08:00,073 INFO L158 Benchmark]: TraceAbstraction took 67135.97ms. Allocated memory is still 246.4MB. Free memory was 176.1MB in the beginning and 155.1MB in the end (delta: 20.9MB). Peak memory consumption was 107.3MB. Max. memory is 8.0GB. [2023-12-16 17:08:00,074 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 195.0MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.83ms. Allocated memory is still 246.4MB. Free memory was 205.4MB in the beginning and 193.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.31ms. Allocated memory is still 246.4MB. Free memory was 193.8MB in the beginning and 192.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.98ms. Allocated memory is still 246.4MB. Free memory was 192.1MB in the beginning and 190.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 247.92ms. Allocated memory is still 246.4MB. Free memory was 190.0MB in the beginning and 176.7MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 67135.97ms. Allocated memory is still 246.4MB. Free memory was 176.1MB in the beginning and 155.1MB in the end (delta: 20.9MB). Peak memory consumption was 107.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall ULTIMATE.start_main_~y~0#1 : bv32 :: ~bvmul~32(~b~0, ~a~0) == ~bvadd~32(~bvmul~32(ULTIMATE.start_main_~y~0#1, ~v~0), ~bvmul~32(~x~0, ~u~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall ULTIMATE.start_main_~y~0#1 : bv32 :: ~bvmul~32(~b~0, ~a~0) == ~bvadd~32(~bvmul~32(ULTIMATE.start_main_~y~0#1, ~v~0), ~bvmul~32(~x~0, ~u~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall ULTIMATE.start_main_~y~0#1 : bv32 :: ~bvmul~32(~b~0, ~a~0) == ~bvadd~32(~bvmul~32(ULTIMATE.start_main_~y~0#1, ~v~0), ~bvmul~32(~x~0, ~u~0))) could not be translated * 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 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.1s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 25.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 1112 SdHoareTripleChecker+Invalid, 24.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 853 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 629 IncrementalHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 259 mSDtfsCounter, 629 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 924 GetRequests, 813 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=6, InterpolantAutomatonStates: 62, 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, 8 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 73 PreInvPairs, 98 NumberOfFragments, 529 HoareAnnotationTreeSize, 73 FormulaSimplifications, 254 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FormulaSimplificationsInter, 718 FormulaSimplificationTreeSizeReductionInter, 9.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 27.3s InterpolantComputationTime, 543 NumberOfCodeBlocks, 543 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 793 ConstructedInterpolants, 2 QuantifiedInterpolants, 3407 SizeOfPredicates, 44 NumberOfNonLiveVariables, 957 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 987/1178 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((((((x + (-1 * -(y))) % 4294967296) > y) && (a >= 1)) && (b <= 2)) && (((x + (-1 * -(y))) % 4294967296) <= 2)) && (a <= 2)) && (b >= 1)) && ((b * a) == (((y * v) + (y * u)) % 4294967296))) || (((((((u == b) && (x >= 1)) && (y == b)) && (b <= 2)) && (x <= 2)) && (a <= 2)) && (b >= 1))) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((((((((x + (-1 * -(y))) % 4294967296) > y) && (a >= 1)) && (b <= 2)) && (((x + (-1 * -(y))) % 4294967296) <= 2)) && (a <= 2)) && (b >= 1)) && ((b * a) == (((y * v) + (y * u)) % 4294967296))) || ((((((((u == b) && !((y == x))) && (x >= 1)) && (y == b)) && (b <= 2)) && (x <= 2)) && (a <= 2)) && (b >= 1))) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((((((((x + (-1 * -(y))) % 4294967296) > y) && (a >= 1)) && (b <= 2)) && (((x + (-1 * -(y))) % 4294967296) <= 2)) && (a <= 2)) && (b >= 1)) && ((b * a) == (((y * v) + (y * u)) % 4294967296))) || (((((((u == b) && !((y == x))) && (x >= 1)) && (y == b)) && (b <= 2)) && (a <= 2)) && !((x > y)))) RESULT: Ultimate proved your program to be correct! [2023-12-16 17:08:00,109 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...