./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5d158962260c30d804a065123fd6610d4547bfb1f0024709f9d294e632350d48 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:45:15,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:45:15,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 00:45:15,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:45:15,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:45:15,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:45:15,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:45:15,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:45:15,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:45:15,613 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:45:15,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:45:15,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:45:15,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:45:15,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:45:15,616 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:45:15,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:45:15,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:45:15,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 00:45:15,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:45:15,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:45:15,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:45:15,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:45:15,622 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:45:15,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:45:15,623 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:45:15,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:45:15,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:45:15,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:45:15,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:45:15,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:45:15,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:45:15,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:45:15,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:45:15,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 00:45:15,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 00:45:15,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:45:15,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:45:15,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:45:15,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:45:15,628 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5d158962260c30d804a065123fd6610d4547bfb1f0024709f9d294e632350d48 [2024-11-12 00:45:15,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:45:15,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:45:15,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:45:15,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:45:15,904 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:45:15,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs.c [2024-11-12 00:45:17,386 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:45:17,593 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:45:17,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs.c [2024-11-12 00:45:17,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0428af7/8ab41f30678b413a9f5ee3200505dd12/FLAG5fad2c397 [2024-11-12 00:45:17,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf0428af7/8ab41f30678b413a9f5ee3200505dd12 [2024-11-12 00:45:17,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:45:17,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:45:17,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:45:17,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:45:17,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:45:17,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:45:17" (1/1) ... [2024-11-12 00:45:17,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d4672cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:17, skipping insertion in model container [2024-11-12 00:45:17,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:45:17" (1/1) ... [2024-11-12 00:45:17,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:45:17,834 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs.c[1246,1259] [2024-11-12 00:45:17,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:45:17,889 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:45:17,898 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs.c[1246,1259] [2024-11-12 00:45:17,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:45:17,943 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:45:17,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:17 WrapperNode [2024-11-12 00:45:17,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:45:17,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:45:17,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:45:17,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:45:17,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:17" (1/1) ... [2024-11-12 00:45:17,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:17" (1/1) ... [2024-11-12 00:45:18,008 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 219 [2024-11-12 00:45:18,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:45:18,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:45:18,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:45:18,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:45:18,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:17" (1/1) ... [2024-11-12 00:45:18,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:17" (1/1) ... [2024-11-12 00:45:18,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:17" (1/1) ... [2024-11-12 00:45:18,067 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 00:45:18,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:17" (1/1) ... [2024-11-12 00:45:18,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:17" (1/1) ... [2024-11-12 00:45:18,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:17" (1/1) ... [2024-11-12 00:45:18,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:17" (1/1) ... [2024-11-12 00:45:18,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:17" (1/1) ... [2024-11-12 00:45:18,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:17" (1/1) ... [2024-11-12 00:45:18,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:45:18,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:45:18,121 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:45:18,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:45:18,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:17" (1/1) ... [2024-11-12 00:45:18,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:45:18,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:45:18,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 00:45:18,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 00:45:18,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:45:18,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 00:45:18,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:45:18,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:45:18,297 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:45:18,299 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:45:18,763 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-12 00:45:18,764 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:45:18,779 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:45:18,779 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:45:18,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:45:18 BoogieIcfgContainer [2024-11-12 00:45:18,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:45:18,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:45:18,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:45:18,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:45:18,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:45:17" (1/3) ... [2024-11-12 00:45:18,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2956e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:45:18, skipping insertion in model container [2024-11-12 00:45:18,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:17" (2/3) ... [2024-11-12 00:45:18,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2956e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:45:18, skipping insertion in model container [2024-11-12 00:45:18,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:45:18" (3/3) ... [2024-11-12 00:45:18,786 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.synabs.c [2024-11-12 00:45:18,800 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:45:18,801 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:45:18,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:45:18,861 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4693283d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:45:18,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:45:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 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) [2024-11-12 00:45:18,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 00:45:18,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:45:18,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:45:18,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:45:18,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:45:18,880 INFO L85 PathProgramCache]: Analyzing trace with hash 75690447, now seen corresponding path program 1 times [2024-11-12 00:45:18,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:45:18,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71116908] [2024-11-12 00:45:18,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:45:18,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:45:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:45:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:45:19,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:45:19,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71116908] [2024-11-12 00:45:19,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71116908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:45:19,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:45:19,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:45:19,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736049864] [2024-11-12 00:45:19,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:45:19,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:45:19,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:45:19,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:45:19,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:45:19,443 INFO L87 Difference]: Start difference. First operand has 58 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 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 4.75) internal successors, (19), 4 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) [2024-11-12 00:45:19,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:45:19,485 INFO L93 Difference]: Finished difference Result 97 states and 141 transitions. [2024-11-12 00:45:19,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:45:19,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-11-12 00:45:19,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:45:19,494 INFO L225 Difference]: With dead ends: 97 [2024-11-12 00:45:19,494 INFO L226 Difference]: Without dead ends: 57 [2024-11-12 00:45:19,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:45:19,499 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 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 [2024-11-12 00:45:19,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:45:19,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-12 00:45:19,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-12 00:45:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 56 states have internal predecessors, (81), 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) [2024-11-12 00:45:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 81 transitions. [2024-11-12 00:45:19,525 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 81 transitions. Word has length 19 [2024-11-12 00:45:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:45:19,525 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 81 transitions. [2024-11-12 00:45:19,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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) [2024-11-12 00:45:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 81 transitions. [2024-11-12 00:45:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 00:45:19,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:45:19,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:45:19,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 00:45:19,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:45:19,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:45:19,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1946868195, now seen corresponding path program 1 times [2024-11-12 00:45:19,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:45:19,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779662315] [2024-11-12 00:45:19,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:45:19,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:45:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:45:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:45:19,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:45:19,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779662315] [2024-11-12 00:45:19,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779662315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:45:19,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:45:19,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:45:19,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771624659] [2024-11-12 00:45:19,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:45:19,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:45:19,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:45:19,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:45:19,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:45:19,667 INFO L87 Difference]: Start difference. First operand 57 states and 81 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2024-11-12 00:45:19,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:45:19,702 INFO L93 Difference]: Finished difference Result 98 states and 139 transitions. [2024-11-12 00:45:19,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:45:19,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-12 00:45:19,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:45:19,703 INFO L225 Difference]: With dead ends: 98 [2024-11-12 00:45:19,704 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 00:45:19,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:45:19,705 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:45:19,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:45:19,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 00:45:19,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-12 00:45:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 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) [2024-11-12 00:45:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2024-11-12 00:45:19,719 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 20 [2024-11-12 00:45:19,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:45:19,719 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2024-11-12 00:45:19,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2024-11-12 00:45:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2024-11-12 00:45:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 00:45:19,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:45:19,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:45:19,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 00:45:19,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:45:19,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:45:19,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1321337752, now seen corresponding path program 1 times [2024-11-12 00:45:19,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:45:19,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491663726] [2024-11-12 00:45:19,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:45:19,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:45:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:45:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:45:19,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:45:19,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491663726] [2024-11-12 00:45:19,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491663726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:45:19,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:45:19,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:45:19,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008822113] [2024-11-12 00:45:19,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:45:19,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:45:19,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:45:19,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:45:19,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:45:19,959 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2024-11-12 00:45:20,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:45:20,039 INFO L93 Difference]: Finished difference Result 100 states and 140 transitions. [2024-11-12 00:45:20,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:45:20,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-11-12 00:45:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:45:20,042 INFO L225 Difference]: With dead ends: 100 [2024-11-12 00:45:20,042 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 00:45:20,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:45:20,043 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 69 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:45:20,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 103 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:45:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 00:45:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-12 00:45:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 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) [2024-11-12 00:45:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2024-11-12 00:45:20,058 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 21 [2024-11-12 00:45:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:45:20,058 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2024-11-12 00:45:20,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2024-11-12 00:45:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2024-11-12 00:45:20,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 00:45:20,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:45:20,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:45:20,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 00:45:20,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:45:20,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:45:20,060 INFO L85 PathProgramCache]: Analyzing trace with hash -65191099, now seen corresponding path program 1 times [2024-11-12 00:45:20,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:45:20,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311513309] [2024-11-12 00:45:20,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:45:20,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:45:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:45:20,112 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 00:45:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:45:20,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 00:45:20,167 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 00:45:20,168 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 00:45:20,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 00:45:20,173 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 00:45:20,213 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 00:45:20,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:45:20 BoogieIcfgContainer [2024-11-12 00:45:20,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 00:45:20,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 00:45:20,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 00:45:20,218 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 00:45:20,219 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:45:18" (3/4) ... [2024-11-12 00:45:20,221 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 00:45:20,222 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 00:45:20,222 INFO L158 Benchmark]: Toolchain (without parser) took 2602.93ms. Allocated memory is still 209.7MB. Free memory was 142.0MB in the beginning and 151.7MB in the end (delta: -9.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:45:20,223 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:45:20,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.57ms. Allocated memory is still 209.7MB. Free memory was 141.6MB in the beginning and 126.9MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 00:45:20,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.94ms. Allocated memory is still 209.7MB. Free memory was 126.9MB in the beginning and 121.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 00:45:20,225 INFO L158 Benchmark]: Boogie Preprocessor took 109.07ms. Allocated memory is still 209.7MB. Free memory was 121.3MB in the beginning and 117.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 00:45:20,226 INFO L158 Benchmark]: RCFGBuilder took 660.31ms. Allocated memory is still 209.7MB. Free memory was 117.8MB in the beginning and 159.9MB in the end (delta: -42.1MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-12 00:45:20,226 INFO L158 Benchmark]: TraceAbstraction took 1435.63ms. Allocated memory is still 209.7MB. Free memory was 158.9MB in the beginning and 151.7MB in the end (delta: 7.1MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-11-12 00:45:20,226 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 209.7MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:45:20,227 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.17ms. Allocated memory is still 109.1MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.57ms. Allocated memory is still 209.7MB. Free memory was 141.6MB in the beginning and 126.9MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.94ms. Allocated memory is still 209.7MB. Free memory was 126.9MB in the beginning and 121.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.07ms. Allocated memory is still 209.7MB. Free memory was 121.3MB in the beginning and 117.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 660.31ms. Allocated memory is still 209.7MB. Free memory was 117.8MB in the beginning and 159.9MB in the end (delta: -42.1MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1435.63ms. Allocated memory is still 209.7MB. Free memory was 158.9MB in the beginning and 151.7MB in the end (delta: 7.1MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 209.7MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 68. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 5); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (5 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 4); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (4 - 1); [L35] const SORT_4 var_5 = 1; [L36] const SORT_8 var_9 = 2; [L37] const SORT_1 var_15 = 1; [L38] const SORT_4 var_19 = 5; [L39] const SORT_4 var_22 = 7; [L40] const SORT_4 var_26 = 11; [L41] const SORT_4 var_29 = 3; [L42] const SORT_8 var_30 = 1; [L43] const SORT_8 var_37 = 5; [L45] SORT_1 input_2; [L46] SORT_1 input_3; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, var_15=1, var_19=5, var_22=7, var_26=11, var_29=3, var_30=1, var_37=5, var_5=1, var_9=2] [L48] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, var_15=1, var_19=5, var_22=7, var_26=11, var_29=3, var_30=1, var_37=5, var_5=1, var_9=2] [L49] SORT_4 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, var_15=1, var_19=5, var_22=7, var_26=11, var_29=3, var_30=1, var_37=5, var_5=1, var_9=2] [L50] SORT_4 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, var_15=1, var_19=5, var_22=7, var_26=11, var_29=3, var_30=1, var_37=5, var_5=1, var_9=2] [L51] SORT_4 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L53] SORT_4 init_7_arg_1 = var_5; [L54] state_6 = init_7_arg_1 [L55] SORT_4 init_21_arg_1 = var_19; [L56] state_20 = init_21_arg_1 [L57] SORT_4 init_24_arg_1 = var_22; [L58] state_23 = init_24_arg_1 [L59] SORT_4 init_28_arg_1 = var_26; [L60] state_27 = init_28_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, state_20=5, state_23=7, state_27=11, state_6=1, var_15=1, var_19=5, var_22=7, var_29=3, var_30=1, var_37=5, var_9=2] [L63] input_2 = __VERIFIER_nondet_uchar() [L64] input_3 = __VERIFIER_nondet_uchar() [L67] SORT_8 var_10_arg_0 = var_9; VAL [mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, state_20=5, state_23=7, state_27=11, state_6=1, var_10_arg_0=2, var_15=1, var_19=5, var_22=7, var_29=3, var_30=1, var_37=5, var_9=2] [L68] EXPR var_10_arg_0 & mask_SORT_8 VAL [mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, state_20=5, state_23=7, state_27=11, state_6=1, var_15=1, var_19=5, var_22=7, var_29=3, var_30=1, var_37=5, var_9=2] [L68] var_10_arg_0 = var_10_arg_0 & mask_SORT_8 [L69] SORT_4 var_10 = var_10_arg_0; [L70] SORT_4 var_11_arg_0 = state_6; [L71] SORT_4 var_11_arg_1 = var_10; [L72] SORT_1 var_11 = var_11_arg_0 == var_11_arg_1; [L73] SORT_1 var_12_arg_0 = var_11; [L74] SORT_1 var_12 = ~var_12_arg_0; [L75] SORT_1 var_16_arg_0 = var_12; [L76] SORT_1 var_16 = ~var_16_arg_0; [L77] SORT_1 var_17_arg_0 = var_15; [L78] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, state_20=5, state_23=7, state_27=11, state_6=1, var_15=1, var_17_arg_0=1, var_17_arg_1=-255, var_19=5, var_22=7, var_29=3, var_30=1, var_37=5, var_9=2] [L79] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, state_20=5, state_23=7, state_27=11, state_6=1, var_15=1, var_19=5, var_22=7, var_29=3, var_30=1, var_37=5, var_9=2] [L79] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L80] EXPR var_17 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, mask_SORT_8=15, state_20=5, state_23=7, state_27=11, state_6=1, var_15=1, var_19=5, var_22=7, var_29=3, var_30=1, var_37=5, var_9=2] [L80] var_17 = var_17 & mask_SORT_1 [L81] SORT_1 bad_18_arg_0 = var_17; [L82] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 549 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 343 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 75 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 206 mSDtfsCounter, 75 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 00:45:20,261 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5d158962260c30d804a065123fd6610d4547bfb1f0024709f9d294e632350d48 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:45:22,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:45:22,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-12 00:45:22,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:45:22,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:45:22,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:45:22,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:45:22,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:45:22,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:45:22,513 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:45:22,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:45:22,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:45:22,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:45:22,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:45:22,519 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:45:22,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:45:22,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:45:22,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:45:22,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:45:22,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:45:22,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:45:22,522 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 00:45:22,522 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 00:45:22,522 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:45:22,522 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 00:45:22,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:45:22,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:45:22,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:45:22,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:45:22,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:45:22,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:45:22,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:45:22,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:45:22,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:45:22,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:45:22,527 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 00:45:22,527 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 00:45:22,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:45:22,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:45:22,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:45:22,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:45:22,529 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5d158962260c30d804a065123fd6610d4547bfb1f0024709f9d294e632350d48 [2024-11-12 00:45:22,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:45:22,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:45:22,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:45:22,878 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:45:22,878 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:45:22,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs.c [2024-11-12 00:45:24,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:45:24,801 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:45:24,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs.c [2024-11-12 00:45:24,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aca81aa3/c91987107d0c4b609ad8bca5898af31a/FLAG38a4a8dfe [2024-11-12 00:45:24,839 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aca81aa3/c91987107d0c4b609ad8bca5898af31a [2024-11-12 00:45:24,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:45:24,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:45:24,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:45:24,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:45:24,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:45:24,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:45:24" (1/1) ... [2024-11-12 00:45:24,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0f8798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:24, skipping insertion in model container [2024-11-12 00:45:24,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:45:24" (1/1) ... [2024-11-12 00:45:24,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:45:25,115 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs.c[1246,1259] [2024-11-12 00:45:25,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:45:25,197 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:45:25,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs.c[1246,1259] [2024-11-12 00:45:25,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:45:25,296 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:45:25,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:25 WrapperNode [2024-11-12 00:45:25,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:45:25,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:45:25,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:45:25,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:45:25,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:25" (1/1) ... [2024-11-12 00:45:25,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:25" (1/1) ... [2024-11-12 00:45:25,345 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 123 [2024-11-12 00:45:25,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:45:25,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:45:25,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:45:25,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:45:25,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:25" (1/1) ... [2024-11-12 00:45:25,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:25" (1/1) ... [2024-11-12 00:45:25,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:25" (1/1) ... [2024-11-12 00:45:25,389 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 00:45:25,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:25" (1/1) ... [2024-11-12 00:45:25,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:25" (1/1) ... [2024-11-12 00:45:25,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:25" (1/1) ... [2024-11-12 00:45:25,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:25" (1/1) ... [2024-11-12 00:45:25,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:25" (1/1) ... [2024-11-12 00:45:25,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:25" (1/1) ... [2024-11-12 00:45:25,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:45:25,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:45:25,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:45:25,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:45:25,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:25" (1/1) ... [2024-11-12 00:45:25,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:45:25,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:45:25,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 00:45:25,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 00:45:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:45:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 00:45:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:45:25,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:45:25,571 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:45:25,576 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:45:25,825 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-12 00:45:25,825 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:45:25,838 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:45:25,839 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:45:25,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:45:25 BoogieIcfgContainer [2024-11-12 00:45:25,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:45:25,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:45:25,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:45:25,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:45:25,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:45:24" (1/3) ... [2024-11-12 00:45:25,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2120613b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:45:25, skipping insertion in model container [2024-11-12 00:45:25,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:45:25" (2/3) ... [2024-11-12 00:45:25,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2120613b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:45:25, skipping insertion in model container [2024-11-12 00:45:25,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:45:25" (3/3) ... [2024-11-12 00:45:25,848 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.synabs.c [2024-11-12 00:45:25,877 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:45:25,877 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:45:25,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:45:25,943 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42853d2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:45:25,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:45:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) [2024-11-12 00:45:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 00:45:25,954 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:45:25,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 00:45:25,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:45:25,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:45:25,963 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-12 00:45:25,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:45:25,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25639855] [2024-11-12 00:45:25,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:45:25,975 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 [2024-11-12 00:45:25,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:45:25,979 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) [2024-11-12 00:45:25,980 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 [2024-11-12 00:45:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:45:26,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 00:45:26,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:45:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:45:26,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 00:45:26,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:45:26,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25639855] [2024-11-12 00:45:26,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25639855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:45:26,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:45:26,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:45:26,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113402038] [2024-11-12 00:45:26,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:45:26,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:45:26,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:45:26,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:45:26,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:45:26,356 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2024-11-12 00:45:26,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:45:26,426 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-12 00:45:26,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:45:26,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-12 00:45:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:45:26,441 INFO L225 Difference]: With dead ends: 18 [2024-11-12 00:45:26,441 INFO L226 Difference]: Without dead ends: 10 [2024-11-12 00:45:26,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:45:26,447 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:45:26,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:45:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-12 00:45:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-12 00:45:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) [2024-11-12 00:45:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-12 00:45:26,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-12 00:45:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:45:26,488 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-12 00:45:26,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2024-11-12 00:45:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-12 00:45:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 00:45:26,489 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:45:26,489 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-12 00:45:26,496 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 [2024-11-12 00:45:26,692 WARN L453 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 [2024-11-12 00:45:26,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:45:26,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:45:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-12 00:45:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:45:26,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295205403] [2024-11-12 00:45:26,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:45:26,698 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 [2024-11-12 00:45:26,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:45:26,701 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) [2024-11-12 00:45:26,702 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 [2024-11-12 00:45:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:45:26,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 00:45:26,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:45:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:45:27,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:45:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:45:28,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:45:28,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295205403] [2024-11-12 00:45:28,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295205403] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:45:28,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 00:45:28,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 00:45:28,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131728773] [2024-11-12 00:45:28,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 00:45:28,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:45:28,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:45:28,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:45:28,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:45:28,405 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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) [2024-11-12 00:45:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:45:28,538 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-12 00:45:28,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:45:28,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 8 [2024-11-12 00:45:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:45:28,539 INFO L225 Difference]: With dead ends: 15 [2024-11-12 00:45:28,539 INFO L226 Difference]: Without dead ends: 13 [2024-11-12 00:45:28,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-12 00:45:28,541 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:45:28,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:45:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-12 00:45:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-12 00:45:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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) [2024-11-12 00:45:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-12 00:45:28,545 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-12 00:45:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:45:28,545 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-12 00:45:28,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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) [2024-11-12 00:45:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-12 00:45:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 00:45:28,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:45:28,546 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-12 00:45:28,549 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 (3)] Ended with exit code 0 [2024-11-12 00:45:28,748 WARN L453 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 [2024-11-12 00:45:28,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:45:28,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:45:28,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-12 00:45:28,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:45:28,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576606619] [2024-11-12 00:45:28,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 00:45:28,751 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 [2024-11-12 00:45:28,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:45:28,754 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) [2024-11-12 00:45:28,755 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 [2024-11-12 00:45:28,857 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 00:45:28,857 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 00:45:28,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-12 00:45:28,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:45:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:45:29,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:45:30,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:45:30,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:45:30,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576606619] [2024-11-12 00:45:30,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576606619] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:45:30,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 00:45:30,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-12 00:45:30,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302187345] [2024-11-12 00:45:30,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 00:45:30,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 00:45:30,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:45:30,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 00:45:30,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:45:30,488 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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) [2024-11-12 00:45:30,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:45:30,616 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-11-12 00:45:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:45:30,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 11 [2024-11-12 00:45:30,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:45:30,617 INFO L225 Difference]: With dead ends: 18 [2024-11-12 00:45:30,617 INFO L226 Difference]: Without dead ends: 16 [2024-11-12 00:45:30,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:45:30,619 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:45:30,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:45:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-12 00:45:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-12 00:45:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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) [2024-11-12 00:45:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-12 00:45:30,623 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-11-12 00:45:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:45:30,623 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-12 00:45:30,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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) [2024-11-12 00:45:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-12 00:45:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 00:45:30,624 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:45:30,624 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-12 00:45:30,628 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 [2024-11-12 00:45:30,824 WARN L453 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 [2024-11-12 00:45:30,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:45:30,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:45:30,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-12 00:45:30,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:45:30,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117988753] [2024-11-12 00:45:30,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 00:45:30,832 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 [2024-11-12 00:45:30,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:45:30,835 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) [2024-11-12 00:45:30,837 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 [2024-11-12 00:45:30,934 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-12 00:45:30,934 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 00:45:30,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 00:45:30,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:45:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:45:31,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:45:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:45:32,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:45:32,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117988753] [2024-11-12 00:45:32,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117988753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:45:32,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 00:45:32,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-12 00:45:32,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612791404] [2024-11-12 00:45:32,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 00:45:32,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 00:45:32,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:45:32,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 00:45:32,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:45:32,377 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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) [2024-11-12 00:45:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:45:32,591 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-11-12 00:45:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 00:45:32,592 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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 14 [2024-11-12 00:45:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:45:32,605 INFO L225 Difference]: With dead ends: 21 [2024-11-12 00:45:32,605 INFO L226 Difference]: Without dead ends: 19 [2024-11-12 00:45:32,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-12 00:45:32,607 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:45:32,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 27 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:45:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-12 00:45:32,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-12 00:45:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 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) [2024-11-12 00:45:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-12 00:45:32,618 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2024-11-12 00:45:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:45:32,619 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-12 00:45:32,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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) [2024-11-12 00:45:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-12 00:45:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 00:45:32,619 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:45:32,619 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2024-11-12 00:45:32,632 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 [2024-11-12 00:45:32,826 WARN L453 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 [2024-11-12 00:45:32,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:45:32,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:45:32,827 INFO L85 PathProgramCache]: Analyzing trace with hash -37306491, now seen corresponding path program 4 times [2024-11-12 00:45:32,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:45:32,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781672095] [2024-11-12 00:45:32,827 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 00:45:32,827 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 [2024-11-12 00:45:32,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:45:32,831 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) [2024-11-12 00:45:32,832 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 [2024-11-12 00:45:32,938 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 00:45:32,938 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 00:45:32,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 00:45:32,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:45:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:45:33,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:45:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:45:35,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:45:35,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781672095] [2024-11-12 00:45:35,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781672095] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:45:35,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 00:45:35,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-12 00:45:35,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795910644] [2024-11-12 00:45:35,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 00:45:35,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 00:45:35,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:45:35,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 00:45:35,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-12 00:45:35,482 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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) [2024-11-12 00:45:37,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:45:37,080 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-12 00:45:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 00:45:37,080 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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 17 [2024-11-12 00:45:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:45:37,081 INFO L225 Difference]: With dead ends: 36 [2024-11-12 00:45:37,081 INFO L226 Difference]: Without dead ends: 34 [2024-11-12 00:45:37,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2024-11-12 00:45:37,083 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:45:37,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:45:37,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-12 00:45:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-12 00:45:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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) [2024-11-12 00:45:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2024-11-12 00:45:37,094 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 17 [2024-11-12 00:45:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:45:37,094 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2024-11-12 00:45:37,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 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) [2024-11-12 00:45:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2024-11-12 00:45:37,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 00:45:37,095 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:45:37,095 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1] [2024-11-12 00:45:37,101 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 [2024-11-12 00:45:37,296 WARN L453 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 [2024-11-12 00:45:37,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:45:37,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:45:37,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1946645219, now seen corresponding path program 5 times [2024-11-12 00:45:37,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:45:37,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641980893] [2024-11-12 00:45:37,298 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 00:45:37,298 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 [2024-11-12 00:45:37,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:45:37,299 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) [2024-11-12 00:45:37,300 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 [2024-11-12 00:45:37,468 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-11-12 00:45:37,468 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 00:45:37,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-12 00:45:37,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:45:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:45:38,495 INFO L312 TraceCheckSpWp]: Computing backward predicates...