/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-64bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.swap_three.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-26 16:06:37,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-26 16:06:37,467 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-12-26 16:06:37,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-26 16:06:37,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-26 16:06:37,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-26 16:06:37,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-26 16:06:37,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-26 16:06:37,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-26 16:06:37,495 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-26 16:06:37,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-26 16:06:37,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-26 16:06:37,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-26 16:06:37,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-26 16:06:37,498 INFO L153 SettingsManager]: * Use SBE=true [2023-12-26 16:06:37,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-26 16:06:37,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-26 16:06:37,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-26 16:06:37,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-26 16:06:37,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-26 16:06:37,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-26 16:06:37,500 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-26 16:06:37,500 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-26 16:06:37,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-26 16:06:37,500 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-26 16:06:37,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-26 16:06:37,500 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-26 16:06:37,501 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-26 16:06:37,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-26 16:06:37,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-26 16:06:37,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-26 16:06:37,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 16:06:37,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-26 16:06:37,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-26 16:06:37,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-26 16:06:37,502 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-26 16:06:37,502 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-26 16:06:37,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-26 16:06:37,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-26 16:06:37,503 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-26 16:06:37,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-26 16:06:37,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-26 16:06:37,503 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-26 16:06:37,503 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-26 16:06:37,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-26 16:06:37,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-26 16:06:37,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-26 16:06:37,716 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-26 16:06:37,716 INFO L274 PluginConnector]: CDTParser initialized [2023-12-26 16:06:37,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.swap_three.c [2023-12-26 16:06:38,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-26 16:06:38,855 INFO L384 CDTParser]: Found 1 translation units. [2023-12-26 16:06:38,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.swap_three.c [2023-12-26 16:06:38,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3db45a1/705cf983fefe4fbb996e354dc2c9f674/FLAGde539d5f7 [2023-12-26 16:06:38,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3db45a1/705cf983fefe4fbb996e354dc2c9f674 [2023-12-26 16:06:38,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-26 16:06:38,879 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-26 16:06:38,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-26 16:06:38,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-26 16:06:38,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-26 16:06:38,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 04:06:38" (1/1) ... [2023-12-26 16:06:38,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@114401ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:06:38, skipping insertion in model container [2023-12-26 16:06:38,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 04:06:38" (1/1) ... [2023-12-26 16:06:38,902 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-26 16:06:39,010 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.swap_three.c[1250,1263] [2023-12-26 16:06:39,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 16:06:39,045 INFO L202 MainTranslator]: Completed pre-run [2023-12-26 16:06:39,056 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.swap_three.c[1250,1263] [2023-12-26 16:06:39,086 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 16:06:39,098 INFO L206 MainTranslator]: Completed translation [2023-12-26 16:06:39,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:06:39 WrapperNode [2023-12-26 16:06:39,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-26 16:06:39,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-26 16:06:39,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-26 16:06:39,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-26 16:06:39,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:06:39" (1/1) ... [2023-12-26 16:06:39,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:06:39" (1/1) ... [2023-12-26 16:06:39,126 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2023-12-26 16:06:39,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-26 16:06:39,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-26 16:06:39,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-26 16:06:39,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-26 16:06:39,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:06:39" (1/1) ... [2023-12-26 16:06:39,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:06:39" (1/1) ... [2023-12-26 16:06:39,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:06:39" (1/1) ... [2023-12-26 16:06:39,144 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-26 16:06:39,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:06:39" (1/1) ... [2023-12-26 16:06:39,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:06:39" (1/1) ... [2023-12-26 16:06:39,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:06:39" (1/1) ... [2023-12-26 16:06:39,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:06:39" (1/1) ... [2023-12-26 16:06:39,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:06:39" (1/1) ... [2023-12-26 16:06:39,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:06:39" (1/1) ... [2023-12-26 16:06:39,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-26 16:06:39,152 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-26 16:06:39,152 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-26 16:06:39,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-26 16:06:39,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:06:39" (1/1) ... [2023-12-26 16:06:39,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 16:06:39,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-26 16:06:39,175 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-26 16:06:39,179 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-26 16:06:39,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-26 16:06:39,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-26 16:06:39,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-26 16:06:39,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-26 16:06:39,244 INFO L241 CfgBuilder]: Building ICFG [2023-12-26 16:06:39,245 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-26 16:06:39,360 INFO L282 CfgBuilder]: Performing block encoding [2023-12-26 16:06:39,384 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-26 16:06:39,384 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-26 16:06:39,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 04:06:39 BoogieIcfgContainer [2023-12-26 16:06:39,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-26 16:06:39,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-26 16:06:39,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-26 16:06:39,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-26 16:06:39,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 04:06:38" (1/3) ... [2023-12-26 16:06:39,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6903677c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 04:06:39, skipping insertion in model container [2023-12-26 16:06:39,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 04:06:39" (2/3) ... [2023-12-26 16:06:39,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6903677c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 04:06:39, skipping insertion in model container [2023-12-26 16:06:39,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 04:06:39" (3/3) ... [2023-12-26 16:06:39,390 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.swap_three.c [2023-12-26 16:06:39,402 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-26 16:06:39,402 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-26 16:06:39,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-26 16:06:39,436 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;@7fd3534d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-26 16:06:39,436 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-26 16:06:39,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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-26 16:06:39,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-26 16:06:39,442 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 16:06:39,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-26 16:06:39,443 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 16:06:39,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 16:06:39,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-12-26 16:06:39,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 16:06:39,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407150511] [2023-12-26 16:06:39,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 16:06:39,455 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-26 16:06:39,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 16:06:39,456 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-26 16:06:39,457 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-26 16:06:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 16:06:39,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-26 16:06:39,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 16:06:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 16:06:39,757 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-26 16:06:39,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 16:06:39,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407150511] [2023-12-26 16:06:39,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407150511] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-26 16:06:39,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-26 16:06:39,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-26 16:06:39,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498627966] [2023-12-26 16:06:39,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-26 16:06:39,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-26 16:06:39,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 16:06:39,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-26 16:06:39,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-26 16:06:39,787 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-26 16:06:39,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 16:06:39,830 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-12-26 16:06:39,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-26 16:06:39,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-26 16:06:39,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 16:06:39,836 INFO L225 Difference]: With dead ends: 16 [2023-12-26 16:06:39,836 INFO L226 Difference]: Without dead ends: 9 [2023-12-26 16:06:39,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-26 16:06:39,840 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-26 16:06:39,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-26 16:06:39,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-26 16:06:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-26 16:06:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 16:06:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-26 16:06:39,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-12-26 16:06:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 16:06:39,860 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-26 16:06:39,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-26 16:06:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-26 16:06:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-26 16:06:39,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 16:06:39,861 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-26 16:06:39,866 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 (2)] Forceful destruction successful, exit code 0 [2023-12-26 16:06:40,065 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-26 16:06:40,066 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 16:06:40,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 16:06:40,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-12-26 16:06:40,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 16:06:40,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549992239] [2023-12-26 16:06:40,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 16:06:40,067 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-26 16:06:40,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 16:06:40,069 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-26 16:06:40,071 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-26 16:06:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 16:06:40,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-26 16:06:40,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 16:06:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 16:06:40,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 16:06:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 16:06:40,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 16:06:40,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549992239] [2023-12-26 16:06:40,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549992239] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 16:06:40,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 16:06:40,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-26 16:06:40,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794478468] [2023-12-26 16:06:40,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 16:06:40,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-26 16:06:40,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 16:06:40,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-26 16:06:40,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-26 16:06:40,435 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-26 16:06:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 16:06:40,503 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-12-26 16:06:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-26 16:06:40,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-26 16:06:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 16:06:40,503 INFO L225 Difference]: With dead ends: 14 [2023-12-26 16:06:40,504 INFO L226 Difference]: Without dead ends: 12 [2023-12-26 16:06:40,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-26 16:06:40,505 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-26 16:06:40,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 12 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-26 16:06:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-26 16:06:40,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-12-26 16:06:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 16:06:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-26 16:06:40,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-12-26 16:06:40,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 16:06:40,511 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-26 16:06:40,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-26 16:06:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-26 16:06:40,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-26 16:06:40,512 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 16:06:40,512 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2023-12-26 16:06:40,515 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-26 16:06:40,715 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-26 16:06:40,715 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 16:06:40,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 16:06:40,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2112524529, now seen corresponding path program 2 times [2023-12-26 16:06:40,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 16:06:40,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667297356] [2023-12-26 16:06:40,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-26 16:06:40,718 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-26 16:06:40,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 16:06:40,719 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-26 16:06:40,719 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-26 16:06:40,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-26 16:06:40,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 16:06:40,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-26 16:06:40,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 16:06:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 16:06:40,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 16:06:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 16:06:41,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 16:06:41,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667297356] [2023-12-26 16:06:41,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667297356] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 16:06:41,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 16:06:41,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-26 16:06:41,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832299501] [2023-12-26 16:06:41,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 16:06:41,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-26 16:06:41,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 16:06:41,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-26 16:06:41,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-26 16:06:41,124 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-26 16:06:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 16:06:41,219 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2023-12-26 16:06:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-26 16:06:41,220 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-26 16:06:41,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 16:06:41,221 INFO L225 Difference]: With dead ends: 21 [2023-12-26 16:06:41,221 INFO L226 Difference]: Without dead ends: 19 [2023-12-26 16:06:41,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-12-26 16:06:41,223 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-26 16:06:41,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 23 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-26 16:06:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-26 16:06:41,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-12-26 16:06:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 16:06:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-12-26 16:06:41,238 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2023-12-26 16:06:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 16:06:41,239 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-12-26 16:06:41,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-26 16:06:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-12-26 16:06:41,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-26 16:06:41,239 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 16:06:41,239 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2023-12-26 16:06:41,257 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 (4)] Forceful destruction successful, exit code 0 [2023-12-26 16:06:41,442 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-26 16:06:41,443 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 16:06:41,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 16:06:41,443 INFO L85 PathProgramCache]: Analyzing trace with hash -57678563, now seen corresponding path program 3 times [2023-12-26 16:06:41,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 16:06:41,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597989762] [2023-12-26 16:06:41,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-26 16:06:41,444 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-26 16:06:41,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 16:06:41,445 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-26 16:06:41,453 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-26 16:06:41,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-26 16:06:41,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 16:06:41,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-26 16:06:41,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 16:06:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-26 16:06:41,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 16:06:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-26 16:06:41,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 16:06:41,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597989762] [2023-12-26 16:06:41,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597989762] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 16:06:41,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 16:06:41,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-26 16:06:41,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783083953] [2023-12-26 16:06:41,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 16:06:41,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-26 16:06:41,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 16:06:41,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-26 16:06:41,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-26 16:06:41,866 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-26 16:06:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 16:06:41,960 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2023-12-26 16:06:41,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-26 16:06:41,960 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-26 16:06:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 16:06:41,960 INFO L225 Difference]: With dead ends: 19 [2023-12-26 16:06:41,961 INFO L226 Difference]: Without dead ends: 17 [2023-12-26 16:06:41,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-12-26 16:06:41,961 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-26 16:06:41,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 20 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-26 16:06:41,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-26 16:06:41,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-26 16:06:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-26 16:06:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2023-12-26 16:06:41,964 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2023-12-26 16:06:41,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 16:06:41,964 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2023-12-26 16:06:41,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-26 16:06:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2023-12-26 16:06:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-26 16:06:41,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 16:06:41,965 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2023-12-26 16:06:41,970 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 (5)] Ended with exit code 0 [2023-12-26 16:06:42,168 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-26 16:06:42,168 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 16:06:42,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 16:06:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash -310375345, now seen corresponding path program 4 times [2023-12-26 16:06:42,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 16:06:42,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806869330] [2023-12-26 16:06:42,169 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-26 16:06:42,169 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-26 16:06:42,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 16:06:42,170 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-26 16:06:42,171 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-26 16:06:42,243 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-26 16:06:42,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 16:06:42,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-26 16:06:42,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 16:06:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-26 16:06:42,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 16:06:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-26 16:06:42,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 16:06:42,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806869330] [2023-12-26 16:06:42,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806869330] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 16:06:42,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 16:06:42,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-26 16:06:42,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805468910] [2023-12-26 16:06:42,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 16:06:42,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-26 16:06:42,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 16:06:42,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-26 16:06:42,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-26 16:06:42,675 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-26 16:06:42,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 16:06:42,754 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2023-12-26 16:06:42,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-26 16:06:42,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-26 16:06:42,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 16:06:42,754 INFO L225 Difference]: With dead ends: 17 [2023-12-26 16:06:42,754 INFO L226 Difference]: Without dead ends: 0 [2023-12-26 16:06:42,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-12-26 16:06:42,755 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-26 16:06:42,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 6 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-26 16:06:42,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-26 16:06:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-26 16:06:42,756 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-26 16:06:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-26 16:06:42,756 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2023-12-26 16:06:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 16:06:42,756 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-26 16:06:42,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-26 16:06:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-26 16:06:42,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-26 16:06:42,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-26 16:06:42,764 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 (6)] Forceful destruction successful, exit code 0 [2023-12-26 16:06:42,961 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-26 16:06:42,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-26 16:06:43,006 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-26 16:06:43,006 INFO L895 garLoopResultBuilder]: At program point L56-2(lines 56 102) the Hoare annotation is: (let ((.cse0 (= (_ bv1 8) |ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse1 (= |ULTIMATE.start_main_~var_13~0#1| (_ bv5 32))) (.cse2 (= (_ bv1048575 32) |ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse3 (= (_ bv7 32) |ULTIMATE.start_main_~var_17~0#1|)) (.cse4 (= |ULTIMATE.start_main_~var_10~0#1| (_ bv1 32)))) (or (and .cse0 .cse1 (= (_ bv5 32) |ULTIMATE.start_main_~state_27~0#1|) (= (_ bv7 32) |ULTIMATE.start_main_~state_30~0#1|) .cse2 .cse3 (= |ULTIMATE.start_main_~state_6~0#1| (_ bv1 32)) .cse4) (and .cse0 .cse1 (= |ULTIMATE.start_main_~state_6~0#1| (_ bv7 32)) (= (_ bv5 32) |ULTIMATE.start_main_~state_30~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~state_27~0#1|) .cse2 .cse3 .cse4) (and .cse0 (= |ULTIMATE.start_main_~state_6~0#1| (_ bv5 32)) .cse1 .cse2 .cse3 (= (_ bv7 32) |ULTIMATE.start_main_~state_27~0#1|) (= (_ bv1 32) |ULTIMATE.start_main_~state_30~0#1|) .cse4))) [2023-12-26 16:06:43,006 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2023-12-26 16:06:43,006 INFO L899 garLoopResultBuilder]: For program point L56-3(lines 56 102) no Hoare annotation was computed. [2023-12-26 16:06:43,006 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2023-12-26 16:06:43,006 INFO L899 garLoopResultBuilder]: For program point L21-3(line 21) no Hoare annotation was computed. [2023-12-26 16:06:43,007 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-26 16:06:43,007 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2023-12-26 16:06:43,009 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2023-12-26 16:06:43,010 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-26 16:06:43,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 04:06:43 BoogieIcfgContainer [2023-12-26 16:06:43,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-26 16:06:43,017 INFO L158 Benchmark]: Toolchain (without parser) took 4138.38ms. Allocated memory was 314.6MB in the beginning and 385.9MB in the end (delta: 71.3MB). Free memory was 267.6MB in the beginning and 174.5MB in the end (delta: 93.1MB). Peak memory consumption was 165.2MB. Max. memory is 8.0GB. [2023-12-26 16:06:43,017 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 225.4MB. Free memory is still 173.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-26 16:06:43,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.16ms. Allocated memory is still 314.6MB. Free memory was 267.6MB in the beginning and 254.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-26 16:06:43,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.32ms. Allocated memory is still 314.6MB. Free memory was 254.9MB in the beginning and 253.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-26 16:06:43,018 INFO L158 Benchmark]: Boogie Preprocessor took 24.79ms. Allocated memory is still 314.6MB. Free memory was 253.0MB in the beginning and 250.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-26 16:06:43,018 INFO L158 Benchmark]: RCFGBuilder took 232.58ms. Allocated memory is still 314.6MB. Free memory was 250.9MB in the beginning and 236.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-26 16:06:43,018 INFO L158 Benchmark]: TraceAbstraction took 3630.71ms. Allocated memory was 314.6MB in the beginning and 385.9MB in the end (delta: 71.3MB). Free memory was 235.5MB in the beginning and 174.5MB in the end (delta: 61.0MB). Peak memory consumption was 132.7MB. Max. memory is 8.0GB. [2023-12-26 16:06:43,019 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.08ms. Allocated memory is still 225.4MB. Free memory is still 173.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.16ms. Allocated memory is still 314.6MB. Free memory was 267.6MB in the beginning and 254.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.32ms. Allocated memory is still 314.6MB. Free memory was 254.9MB in the beginning and 253.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.79ms. Allocated memory is still 314.6MB. Free memory was 253.0MB in the beginning and 250.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 232.58ms. Allocated memory is still 314.6MB. Free memory was 250.9MB in the beginning and 236.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 3630.71ms. Allocated memory was 314.6MB in the beginning and 385.9MB in the end (delta: 71.3MB). Free memory was 235.5MB in the beginning and 174.5MB in the end (delta: 61.0MB). Peak memory consumption was 132.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: 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 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 159 IncrementalHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 17 mSDtfsCounter, 159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=3, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 4 NumberOfFragments, 76 HoareAnnotationTreeSize, 1 FormulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FormulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 87 ConstructedInterpolants, 34 QuantifiedInterpolants, 2669 SizeOfPredicates, 127 NumberOfNonLiveVariables, 670 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 10/100 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: 56]: Loop Invariant Derived loop invariant: ((((((((((1 == mask_SORT_1) && (var_13 == 5)) && (5 == state_27)) && (7 == state_30)) && (1048575 == mask_SORT_4)) && (7 == var_17)) && (state_6 == 1)) && (var_10 == 1)) || ((((((((1 == mask_SORT_1) && (var_13 == 5)) && (state_6 == 7)) && (5 == state_30)) && (1 == state_27)) && (1048575 == mask_SORT_4)) && (7 == var_17)) && (var_10 == 1))) || ((((((((1 == mask_SORT_1) && (state_6 == 5)) && (var_13 == 5)) && (1048575 == mask_SORT_4)) && (7 == var_17)) && (7 == state_27)) && (1 == state_30)) && (var_10 == 1))) RESULT: Ultimate proved your program to be correct! [2023-12-26 16:06:43,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...