./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/num_conversion_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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/bitvector/num_conversion_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:32:26,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:32:26,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 09:32:26,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:32:26,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:32:26,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:32:26,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:32:26,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:32:26,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:32:26,955 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:32:26,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:32:26,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:32:26,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:32:26,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:32:26,957 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:32:26,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:32:26,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:32:26,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:32:26,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 09:32:26,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:32:26,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:32:26,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:32:26,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:32:26,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:32:26,959 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:32:26,959 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:32:26,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:32:26,960 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:32:26,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:32:26,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:32:26,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:32:26,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:32:26,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:32:26,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:32:26,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:32:26,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:32:26,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 09:32:26,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 09:32:26,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:32:26,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:32:26,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:32:26,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:32:26,963 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 [2024-11-18 09:32:27,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:32:27,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:32:27,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:32:27,178 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:32:27,179 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:32:27,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_2.c [2024-11-18 09:32:28,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:32:28,511 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:32:28,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c [2024-11-18 09:32:28,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab686ea9a/0916d84d9bba46b88203c4975e1c34d6/FLAG3ee60a17a [2024-11-18 09:32:28,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab686ea9a/0916d84d9bba46b88203c4975e1c34d6 [2024-11-18 09:32:28,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:32:28,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:32:28,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:32:28,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:32:28,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:32:28,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:32:28" (1/1) ... [2024-11-18 09:32:28,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e98b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:28, skipping insertion in model container [2024-11-18 09:32:28,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:32:28" (1/1) ... [2024-11-18 09:32:28,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:32:29,094 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/bitvector/num_conversion_2.c[685,698] [2024-11-18 09:32:29,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:32:29,121 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:32:29,132 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/bitvector/num_conversion_2.c[685,698] [2024-11-18 09:32:29,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:32:29,150 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:32:29,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:29 WrapperNode [2024-11-18 09:32:29,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:32:29,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:32:29,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:32:29,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:32:29,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:29" (1/1) ... [2024-11-18 09:32:29,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:29" (1/1) ... [2024-11-18 09:32:29,186 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2024-11-18 09:32:29,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:32:29,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:32:29,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:32:29,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:32:29,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:29" (1/1) ... [2024-11-18 09:32:29,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:29" (1/1) ... [2024-11-18 09:32:29,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:29" (1/1) ... [2024-11-18 09:32:29,212 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-18 09:32:29,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:29" (1/1) ... [2024-11-18 09:32:29,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:29" (1/1) ... [2024-11-18 09:32:29,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:29" (1/1) ... [2024-11-18 09:32:29,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:29" (1/1) ... [2024-11-18 09:32:29,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:29" (1/1) ... [2024-11-18 09:32:29,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:29" (1/1) ... [2024-11-18 09:32:29,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:32:29,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:32:29,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:32:29,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:32:29,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:29" (1/1) ... [2024-11-18 09:32:29,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:32:29,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:29,252 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-18 09:32:29,255 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-18 09:32:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:32:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:32:29,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:32:29,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 09:32:29,348 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:32:29,350 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:32:29,495 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-18 09:32:29,495 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:32:29,510 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:32:29,510 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 09:32:29,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:29 BoogieIcfgContainer [2024-11-18 09:32:29,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:32:29,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:32:29,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:32:29,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:32:29,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:32:28" (1/3) ... [2024-11-18 09:32:29,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2711b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:32:29, skipping insertion in model container [2024-11-18 09:32:29,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:29" (2/3) ... [2024-11-18 09:32:29,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2711b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:32:29, skipping insertion in model container [2024-11-18 09:32:29,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:29" (3/3) ... [2024-11-18 09:32:29,519 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_2.c [2024-11-18 09:32:29,531 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:32:29,531 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:32:29,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:32:29,581 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;@5da99bca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:32:29,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:32:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 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-18 09:32:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-18 09:32:29,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:29,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-18 09:32:29,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:29,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash 889661639, now seen corresponding path program 1 times [2024-11-18 09:32:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:29,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040522542] [2024-11-18 09:32:29,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:29,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:29,774 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-18 09:32:29,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:29,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040522542] [2024-11-18 09:32:29,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040522542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:29,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:29,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:32:29,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505127083] [2024-11-18 09:32:29,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:29,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:32:29,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:29,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:32:29,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:32:29,797 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-18 09:32:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:29,822 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2024-11-18 09:32:29,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:32:29,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-18 09:32:29,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:29,830 INFO L225 Difference]: With dead ends: 47 [2024-11-18 09:32:29,830 INFO L226 Difference]: Without dead ends: 25 [2024-11-18 09:32:29,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:32:29,835 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:29,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 38 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:32:29,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-18 09:32:29,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2024-11-18 09:32:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-18 09:32:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-18 09:32:29,866 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 6 [2024-11-18 09:32:29,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:29,866 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-18 09:32:29,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-18 09:32:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-18 09:32:29,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 09:32:29,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:29,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:29,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 09:32:29,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:29,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:29,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2083677087, now seen corresponding path program 1 times [2024-11-18 09:32:29,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:29,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134850176] [2024-11-18 09:32:29,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:29,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:30,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:30,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134850176] [2024-11-18 09:32:30,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134850176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:30,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:30,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 09:32:30,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969381967] [2024-11-18 09:32:30,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:30,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 09:32:30,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:30,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 09:32:30,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 09:32:30,032 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:30,050 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-11-18 09:32:30,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 09:32:30,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-18 09:32:30,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:30,051 INFO L225 Difference]: With dead ends: 34 [2024-11-18 09:32:30,051 INFO L226 Difference]: Without dead ends: 20 [2024-11-18 09:32:30,052 INFO L431 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-18 09:32:30,053 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:30,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:32:30,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-18 09:32:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-18 09:32:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-18 09:32:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-18 09:32:30,056 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2024-11-18 09:32:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:30,057 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-18 09:32:30,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-18 09:32:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 09:32:30,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:30,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:30,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 09:32:30,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:30,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:30,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2140935389, now seen corresponding path program 1 times [2024-11-18 09:32:30,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:30,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169222541] [2024-11-18 09:32:30,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:30,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:30,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:30,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:30,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169222541] [2024-11-18 09:32:30,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169222541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:30,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686787013] [2024-11-18 09:32:30,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:30,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:30,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:30,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:32:30,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 09:32:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:30,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-18 09:32:30,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:30,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:30,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686787013] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:30,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:30,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 7] total 15 [2024-11-18 09:32:30,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226028252] [2024-11-18 09:32:30,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:30,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 09:32:30,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:30,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 09:32:30,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-11-18 09:32:30,582 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:30,759 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-11-18 09:32:30,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 09:32:30,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-18 09:32:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:30,764 INFO L225 Difference]: With dead ends: 36 [2024-11-18 09:32:30,764 INFO L226 Difference]: Without dead ends: 32 [2024-11-18 09:32:30,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2024-11-18 09:32:30,765 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 44 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:30,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 42 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:32:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-18 09:32:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-18 09:32:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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-18 09:32:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-18 09:32:30,770 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2024-11-18 09:32:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:30,770 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-18 09:32:30,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-18 09:32:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 09:32:30,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:30,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:30,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 09:32:30,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:30,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:30,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2024916264, now seen corresponding path program 1 times [2024-11-18 09:32:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:30,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269244657] [2024-11-18 09:32:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:31,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:31,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269244657] [2024-11-18 09:32:31,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269244657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:31,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266860025] [2024-11-18 09:32:31,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:31,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:31,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:31,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:32:31,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 09:32:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:31,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 09:32:31,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:31,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:32:31,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266860025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:31,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 09:32:31,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2024-11-18 09:32:31,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885557007] [2024-11-18 09:32:31,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:31,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:32:31,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:31,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:32:31,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-18 09:32:31,162 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-18 09:32:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:31,203 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-11-18 09:32:31,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:32:31,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 14 [2024-11-18 09:32:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:31,205 INFO L225 Difference]: With dead ends: 69 [2024-11-18 09:32:31,205 INFO L226 Difference]: Without dead ends: 43 [2024-11-18 09:32:31,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-18 09:32:31,206 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:31,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 41 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:32:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-18 09:32:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2024-11-18 09:32:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 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-18 09:32:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-18 09:32:31,214 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 14 [2024-11-18 09:32:31,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:31,214 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-18 09:32:31,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-18 09:32:31,214 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-18 09:32:31,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-18 09:32:31,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:31,215 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:31,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 09:32:31,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-18 09:32:31,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:31,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:31,419 INFO L85 PathProgramCache]: Analyzing trace with hash 704436752, now seen corresponding path program 1 times [2024-11-18 09:32:31,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:31,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411278760] [2024-11-18 09:32:31,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:31,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:31,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:31,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:31,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411278760] [2024-11-18 09:32:31,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411278760] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:31,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174208238] [2024-11-18 09:32:31,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:31,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:31,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:31,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:32:31,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 09:32:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:31,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-18 09:32:31,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:31,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:31,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174208238] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:31,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:32:31,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 18 [2024-11-18 09:32:31,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156753707] [2024-11-18 09:32:31,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:31,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-18 09:32:31,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:31,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-18 09:32:31,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-18 09:32:31,881 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 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-18 09:32:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:32,289 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2024-11-18 09:32:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-18 09:32:32,289 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 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-18 09:32:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:32,290 INFO L225 Difference]: With dead ends: 165 [2024-11-18 09:32:32,290 INFO L226 Difference]: Without dead ends: 101 [2024-11-18 09:32:32,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2024-11-18 09:32:32,291 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 218 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:32,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 93 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 09:32:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-18 09:32:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2024-11-18 09:32:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 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-18 09:32:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 115 transitions. [2024-11-18 09:32:32,300 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 115 transitions. Word has length 21 [2024-11-18 09:32:32,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:32,300 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 115 transitions. [2024-11-18 09:32:32,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 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-18 09:32:32,300 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2024-11-18 09:32:32,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-18 09:32:32,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:32,302 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:32,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 09:32:32,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:32,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:32,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:32,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1363178434, now seen corresponding path program 1 times [2024-11-18 09:32:32,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:32,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245573041] [2024-11-18 09:32:32,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:32,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:32,594 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:32,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:32,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245573041] [2024-11-18 09:32:32,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245573041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:32,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487385640] [2024-11-18 09:32:32,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:32,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:32,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:32,597 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:32:32,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 09:32:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:32,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-18 09:32:32,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:32:32,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 09:32:33,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487385640] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:33,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:32:33,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 16 [2024-11-18 09:32:33,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937547197] [2024-11-18 09:32:33,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:33,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-18 09:32:33,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:33,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-18 09:32:33,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-18 09:32:33,061 INFO L87 Difference]: Start difference. First operand 89 states and 115 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 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-18 09:32:33,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:33,728 INFO L93 Difference]: Finished difference Result 397 states and 521 transitions. [2024-11-18 09:32:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-18 09:32:33,728 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 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 30 [2024-11-18 09:32:33,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:33,735 INFO L225 Difference]: With dead ends: 397 [2024-11-18 09:32:33,735 INFO L226 Difference]: Without dead ends: 342 [2024-11-18 09:32:33,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=321, Invalid=1319, Unknown=0, NotChecked=0, Total=1640 [2024-11-18 09:32:33,737 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 315 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:33,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 258 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 09:32:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-18 09:32:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 231. [2024-11-18 09:32:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.3130434782608695) internal successors, (302), 230 states have internal predecessors, (302), 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-18 09:32:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 302 transitions. [2024-11-18 09:32:33,766 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 302 transitions. Word has length 30 [2024-11-18 09:32:33,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:33,766 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 302 transitions. [2024-11-18 09:32:33,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 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-18 09:32:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 302 transitions. [2024-11-18 09:32:33,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 09:32:33,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:33,769 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:33,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 09:32:33,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:33,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:33,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:33,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2063550545, now seen corresponding path program 1 times [2024-11-18 09:32:33,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:33,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588246295] [2024-11-18 09:32:33,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:33,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-18 09:32:34,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:34,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588246295] [2024-11-18 09:32:34,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588246295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:34,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:34,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 09:32:34,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574011943] [2024-11-18 09:32:34,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:34,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 09:32:34,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 09:32:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 09:32:34,080 INFO L87 Difference]: Start difference. First operand 231 states and 302 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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-18 09:32:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:34,106 INFO L93 Difference]: Finished difference Result 446 states and 589 transitions. [2024-11-18 09:32:34,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 09:32:34,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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 38 [2024-11-18 09:32:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:34,108 INFO L225 Difference]: With dead ends: 446 [2024-11-18 09:32:34,108 INFO L226 Difference]: Without dead ends: 251 [2024-11-18 09:32:34,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-18 09:32:34,109 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:34,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:32:34,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-18 09:32:34,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 235. [2024-11-18 09:32:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.2735042735042734) internal successors, (298), 234 states have internal predecessors, (298), 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-18 09:32:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 298 transitions. [2024-11-18 09:32:34,129 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 298 transitions. Word has length 38 [2024-11-18 09:32:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:34,129 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 298 transitions. [2024-11-18 09:32:34,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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-18 09:32:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 298 transitions. [2024-11-18 09:32:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-18 09:32:34,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:34,130 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:34,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 09:32:34,131 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:34,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash 78406084, now seen corresponding path program 2 times [2024-11-18 09:32:34,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:34,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024233874] [2024-11-18 09:32:34,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:32:34,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:34,160 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:32:34,160 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:34,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 09:32:34,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024233874] [2024-11-18 09:32:34,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024233874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 09:32:34,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315869506] [2024-11-18 09:32:34,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:32:34,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:34,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:34,265 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 09:32:34,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 09:32:34,308 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:32:34,309 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:34,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-18 09:32:34,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:34,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:34,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315869506] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:34,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 09:32:34,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2024-11-18 09:32:34,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583088969] [2024-11-18 09:32:34,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:34,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-18 09:32:34,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 09:32:34,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-18 09:32:34,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2024-11-18 09:32:34,612 INFO L87 Difference]: Start difference. First operand 235 states and 298 transitions. Second operand has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 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-18 09:32:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:34,803 INFO L93 Difference]: Finished difference Result 640 states and 834 transitions. [2024-11-18 09:32:34,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-18 09:32:34,804 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 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 39 [2024-11-18 09:32:34,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:34,805 INFO L225 Difference]: With dead ends: 640 [2024-11-18 09:32:34,805 INFO L226 Difference]: Without dead ends: 534 [2024-11-18 09:32:34,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=354, Unknown=0, NotChecked=0, Total=552 [2024-11-18 09:32:34,806 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 236 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:34,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 385 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:32:34,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-18 09:32:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 398. [2024-11-18 09:32:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.2745591939546599) internal successors, (506), 397 states have internal predecessors, (506), 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-18 09:32:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 506 transitions. [2024-11-18 09:32:34,826 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 506 transitions. Word has length 39 [2024-11-18 09:32:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:34,827 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 506 transitions. [2024-11-18 09:32:34,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 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-18 09:32:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 506 transitions. [2024-11-18 09:32:34,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-18 09:32:34,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:34,830 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:34,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-18 09:32:35,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 09:32:35,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:35,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:35,034 INFO L85 PathProgramCache]: Analyzing trace with hash 303057016, now seen corresponding path program 3 times [2024-11-18 09:32:35,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 09:32:35,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444756736] [2024-11-18 09:32:35,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 09:32:35,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 09:32:35,060 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-18 09:32:35,060 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-18 09:32:35,060 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 09:32:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 09:32:35,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 09:32:35,105 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 09:32:35,106 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 09:32:35,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 09:32:35,109 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:35,136 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 09:32:35,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:32:35 BoogieIcfgContainer [2024-11-18 09:32:35,138 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 09:32:35,139 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 09:32:35,139 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 09:32:35,139 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 09:32:35,139 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:29" (3/4) ... [2024-11-18 09:32:35,141 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 09:32:35,142 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 09:32:35,142 INFO L158 Benchmark]: Toolchain (without parser) took 6204.22ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 142.5MB in the beginning and 62.5MB in the end (delta: 80.0MB). Peak memory consumption was 115.5MB. Max. memory is 16.1GB. [2024-11-18 09:32:35,142 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory was 88.1MB in the beginning and 88.0MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:32:35,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.82ms. Allocated memory is still 172.0MB. Free memory was 142.5MB in the beginning and 130.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 09:32:35,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.25ms. Allocated memory is still 172.0MB. Free memory was 130.3MB in the beginning and 128.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:32:35,143 INFO L158 Benchmark]: Boogie Preprocessor took 33.90ms. Allocated memory is still 172.0MB. Free memory was 128.3MB in the beginning and 126.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:32:35,143 INFO L158 Benchmark]: RCFGBuilder took 289.85ms. Allocated memory is still 172.0MB. Free memory was 126.9MB in the beginning and 115.1MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 09:32:35,143 INFO L158 Benchmark]: TraceAbstraction took 5624.83ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 114.3MB in the beginning and 62.5MB in the end (delta: 51.8MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. [2024-11-18 09:32:35,143 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 207.6MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:32:35,144 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.18ms. Allocated memory is still 125.8MB. Free memory was 88.1MB in the beginning and 88.0MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.82ms. Allocated memory is still 172.0MB. Free memory was 142.5MB in the beginning and 130.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.25ms. Allocated memory is still 172.0MB. Free memory was 130.3MB in the beginning and 128.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.90ms. Allocated memory is still 172.0MB. Free memory was 128.3MB in the beginning and 126.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 289.85ms. Allocated memory is still 172.0MB. Free memory was 126.9MB in the beginning and 115.1MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5624.83ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 114.3MB in the beginning and 62.5MB in the end (delta: 51.8MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 207.6MB. Free memory is still 62.5MB. 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: 16]: 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 shiftLeft at line 31. Possible FailurePath: [L24] unsigned char x = __VERIFIER_nondet_uchar(); [L25] unsigned char y; [L26] unsigned char c; [L28] y = 0 [L29] c = 0 VAL [c=0, y=0] [L30] COND TRUE c < (unsigned char)8 VAL [c=0, y=0] [L31] EXPR ((unsigned char)1) << c VAL [c=0, y=0] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=0, i=1, x=1, y=0] [L32] unsigned char bit = x & i; [L33] COND TRUE bit != (unsigned char)0 [L34] y = y + i VAL [c=0, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=1, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=1, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=1, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=1, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=2, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=2, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=2, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=2, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=3, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=3, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=3, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=3, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=4, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=4, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=4, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=4, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=5, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=5, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=5, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=5, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=6, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=6, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=6, i=256, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND FALSE !(bit != (unsigned char)0) VAL [c=6, i=256, x=1, y=1] [L36] c = c + ((unsigned char)1) [L30] COND TRUE c < (unsigned char)8 VAL [c=7, x=1, y=1] [L31] EXPR ((unsigned char)1) << c VAL [c=7, x=1, y=1] [L31] unsigned char i = ((unsigned char)1) << c; [L32] EXPR x & i VAL [c=7, i=257, x=1, y=1] [L32] unsigned char bit = x & i; [L33] COND TRUE bit != (unsigned char)0 [L34] y = y + i VAL [c=7, x=1, y=2] [L36] c = c + ((unsigned char)1) [L30] COND FALSE !(c < (unsigned char)8) VAL [x=1, y=2] [L38] CALL __VERIFIER_assert(x == y) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 861 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 861 mSDsluCounter, 940 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 759 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1030 IncrementalHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 181 mSDtfsCounter, 1030 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 179 SyntacticMatches, 4 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=398occurred in iteration=8, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 296 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 377 ConstructedInterpolants, 0 QuantifiedInterpolants, 2334 SizeOfPredicates, 14 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 94/307 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-18 09:32:35,163 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/bitvector/num_conversion_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 09:32:36,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 09:32:37,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 09:32:37,040 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 09:32:37,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 09:32:37,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 09:32:37,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 09:32:37,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 09:32:37,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 09:32:37,072 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 09:32:37,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 09:32:37,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 09:32:37,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 09:32:37,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 09:32:37,075 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 09:32:37,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 09:32:37,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 09:32:37,077 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 09:32:37,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 09:32:37,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 09:32:37,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 09:32:37,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 09:32:37,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 09:32:37,080 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 09:32:37,080 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 09:32:37,080 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 09:32:37,081 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 09:32:37,081 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 09:32:37,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 09:32:37,081 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 09:32:37,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 09:32:37,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 09:32:37,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 09:32:37,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 09:32:37,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:32:37,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 09:32:37,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 09:32:37,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 09:32:37,083 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 09:32:37,083 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 09:32:37,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 09:32:37,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 09:32:37,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 09:32:37,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 09:32:37,085 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e0da033eb6b5a3b4db0394198751cf880534ee28b64f0bd7b196bfba1d785e1 [2024-11-18 09:32:37,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 09:32:37,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 09:32:37,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 09:32:37,380 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 09:32:37,380 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 09:32:37,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_2.c [2024-11-18 09:32:38,687 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 09:32:38,823 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 09:32:38,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_2.c [2024-11-18 09:32:38,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bebed898/8f5d4d9d9f9d4e1392b29eab05cde0db/FLAG520e97525 [2024-11-18 09:32:38,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bebed898/8f5d4d9d9f9d4e1392b29eab05cde0db [2024-11-18 09:32:38,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 09:32:38,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 09:32:38,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 09:32:38,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 09:32:38,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 09:32:38,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:32:38" (1/1) ... [2024-11-18 09:32:38,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513543d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:38, skipping insertion in model container [2024-11-18 09:32:38,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:32:38" (1/1) ... [2024-11-18 09:32:38,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 09:32:39,024 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/bitvector/num_conversion_2.c[685,698] [2024-11-18 09:32:39,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:32:39,052 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 09:32:39,062 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/bitvector/num_conversion_2.c[685,698] [2024-11-18 09:32:39,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 09:32:39,080 INFO L204 MainTranslator]: Completed translation [2024-11-18 09:32:39,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:39 WrapperNode [2024-11-18 09:32:39,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 09:32:39,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 09:32:39,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 09:32:39,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 09:32:39,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:39" (1/1) ... [2024-11-18 09:32:39,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:39" (1/1) ... [2024-11-18 09:32:39,104 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2024-11-18 09:32:39,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 09:32:39,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 09:32:39,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 09:32:39,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 09:32:39,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:39" (1/1) ... [2024-11-18 09:32:39,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:39" (1/1) ... [2024-11-18 09:32:39,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:39" (1/1) ... [2024-11-18 09:32:39,124 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-18 09:32:39,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:39" (1/1) ... [2024-11-18 09:32:39,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:39" (1/1) ... [2024-11-18 09:32:39,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:39" (1/1) ... [2024-11-18 09:32:39,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:39" (1/1) ... [2024-11-18 09:32:39,133 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:39" (1/1) ... [2024-11-18 09:32:39,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:39" (1/1) ... [2024-11-18 09:32:39,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 09:32:39,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 09:32:39,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 09:32:39,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 09:32:39,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:39" (1/1) ... [2024-11-18 09:32:39,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 09:32:39,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 09:32:39,166 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-18 09:32:39,168 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-18 09:32:39,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 09:32:39,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 09:32:39,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 09:32:39,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 09:32:39,258 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 09:32:39,259 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 09:32:39,350 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-18 09:32:39,350 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 09:32:39,359 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 09:32:39,359 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 09:32:39,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:39 BoogieIcfgContainer [2024-11-18 09:32:39,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 09:32:39,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 09:32:39,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 09:32:39,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 09:32:39,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:32:38" (1/3) ... [2024-11-18 09:32:39,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550e3987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:32:39, skipping insertion in model container [2024-11-18 09:32:39,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:32:39" (2/3) ... [2024-11-18 09:32:39,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550e3987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:32:39, skipping insertion in model container [2024-11-18 09:32:39,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:32:39" (3/3) ... [2024-11-18 09:32:39,368 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_2.c [2024-11-18 09:32:39,380 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 09:32:39,380 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 09:32:39,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 09:32:39,442 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;@2132a5cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 09:32:39,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 09:32:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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-18 09:32:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-18 09:32:39,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:39,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-18 09:32:39,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:39,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:39,456 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2024-11-18 09:32:39,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:39,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855983799] [2024-11-18 09:32:39,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:39,467 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-18 09:32:39,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:39,469 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-18 09:32:39,471 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-18 09:32:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:39,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 09:32:39,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:39,553 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-18 09:32:39,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:32:39,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:39,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855983799] [2024-11-18 09:32:39,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855983799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:39,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:39,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 09:32:39,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452618673] [2024-11-18 09:32:39,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:39,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 09:32:39,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:39,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 09:32:39,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 09:32:39,580 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-18 09:32:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:39,590 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-18 09:32:39,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 09:32:39,592 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-11-18 09:32:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:39,597 INFO L225 Difference]: With dead ends: 21 [2024-11-18 09:32:39,597 INFO L226 Difference]: Without dead ends: 9 [2024-11-18 09:32:39,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 09:32:39,603 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:39,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:32:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-18 09:32:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-18 09:32:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 09:32:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-18 09:32:39,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2024-11-18 09:32:39,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:39,628 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-18 09:32:39,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-18 09:32:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2024-11-18 09:32:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-18 09:32:39,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:39,629 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-18 09:32:39,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 (2)] Ended with exit code 0 [2024-11-18 09:32:39,829 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-18 09:32:39,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:39,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:39,830 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2024-11-18 09:32:39,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:39,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429666258] [2024-11-18 09:32:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:39,833 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-18 09:32:39,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:39,835 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-18 09:32:39,836 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-18 09:32:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:39,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 09:32:39,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:39,905 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-18 09:32:39,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 09:32:39,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:39,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429666258] [2024-11-18 09:32:39,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429666258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 09:32:39,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 09:32:39,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 09:32:39,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571330304] [2024-11-18 09:32:39,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 09:32:39,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 09:32:39,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:39,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 09:32:39,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:32:39,907 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-18 09:32:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:39,918 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-18 09:32:39,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 09:32:39,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-18 09:32:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:39,919 INFO L225 Difference]: With dead ends: 16 [2024-11-18 09:32:39,920 INFO L226 Difference]: Without dead ends: 12 [2024-11-18 09:32:39,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 09:32:39,921 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:39,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:32:39,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-18 09:32:39,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2024-11-18 09:32:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) 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-18 09:32:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2024-11-18 09:32:39,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2024-11-18 09:32:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:39,924 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-11-18 09:32:39,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-18 09:32:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2024-11-18 09:32:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-18 09:32:39,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:39,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:39,927 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-18 09:32:40,125 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-18 09:32:40,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:40,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:40,126 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2024-11-18 09:32:40,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:40,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404045616] [2024-11-18 09:32:40,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:40,127 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-18 09:32:40,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:40,130 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-18 09:32:40,131 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-18 09:32:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:40,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 09:32:40,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:40,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:40,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:40,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404045616] [2024-11-18 09:32:40,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404045616] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:40,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:40,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-18 09:32:40,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141650272] [2024-11-18 09:32:40,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:40,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 09:32:40,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:40,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 09:32:40,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-18 09:32:40,231 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-18 09:32:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:40,268 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2024-11-18 09:32:40,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 09:32:40,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 9 [2024-11-18 09:32:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:40,270 INFO L225 Difference]: With dead ends: 23 [2024-11-18 09:32:40,270 INFO L226 Difference]: Without dead ends: 19 [2024-11-18 09:32:40,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-18 09:32:40,271 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:40,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 09:32:40,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-18 09:32:40,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-18 09:32:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-18 09:32:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-18 09:32:40,275 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2024-11-18 09:32:40,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:40,275 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-18 09:32:40,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-18 09:32:40,275 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-18 09:32:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 09:32:40,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:40,276 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:40,280 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-18 09:32:40,477 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-18 09:32:40,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:40,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:40,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2024-11-18 09:32:40,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:40,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360671174] [2024-11-18 09:32:40,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 09:32:40,479 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-18 09:32:40,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:40,483 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-18 09:32:40,483 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-18 09:32:40,511 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 09:32:40,511 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:40,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 09:32:40,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:40,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:40,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:40,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360671174] [2024-11-18 09:32:40,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360671174] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:40,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:40,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-18 09:32:40,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683471671] [2024-11-18 09:32:40,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:40,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 09:32:40,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:40,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 09:32:40,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-18 09:32:40,712 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-18 09:32:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:40,809 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-11-18 09:32:40,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 09:32:40,810 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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 18 [2024-11-18 09:32:40,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:40,811 INFO L225 Difference]: With dead ends: 35 [2024-11-18 09:32:40,811 INFO L226 Difference]: Without dead ends: 31 [2024-11-18 09:32:40,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-18 09:32:40,812 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:40,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 86 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 09:32:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-18 09:32:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-18 09:32:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-18 09:32:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-18 09:32:40,821 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2024-11-18 09:32:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:40,821 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-18 09:32:40,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-18 09:32:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-18 09:32:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-18 09:32:40,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:40,823 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:40,826 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-18 09:32:41,023 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-18 09:32:41,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:41,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:41,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1720528430, now seen corresponding path program 3 times [2024-11-18 09:32:41,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:41,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620894552] [2024-11-18 09:32:41,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 09:32:41,025 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-18 09:32:41,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:41,027 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-18 09:32:41,028 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-18 09:32:41,066 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-18 09:32:41,066 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 09:32:41,068 WARN L253 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-18 09:32:41,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 40 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:43,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:32:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 9 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:46,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:32:46,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620894552] [2024-11-18 09:32:46,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620894552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 09:32:46,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 09:32:46,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 53 [2024-11-18 09:32:46,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244008011] [2024-11-18 09:32:46,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 09:32:46,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-18 09:32:46,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 09:32:46,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-18 09:32:46,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=2170, Unknown=0, NotChecked=0, Total=2756 [2024-11-18 09:32:46,028 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 53 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 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-18 09:32:53,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 09:32:53,571 INFO L93 Difference]: Finished difference Result 148 states and 191 transitions. [2024-11-18 09:32:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-18 09:32:53,575 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 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 30 [2024-11-18 09:32:53,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 09:32:53,577 INFO L225 Difference]: With dead ends: 148 [2024-11-18 09:32:53,577 INFO L226 Difference]: Without dead ends: 143 [2024-11-18 09:32:53,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3061 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=2039, Invalid=7467, Unknown=0, NotChecked=0, Total=9506 [2024-11-18 09:32:53,580 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 09:32:53,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 76 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 09:32:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-18 09:32:53,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 95. [2024-11-18 09:32:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 94 states have internal predecessors, (126), 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-18 09:32:53,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2024-11-18 09:32:53,598 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 30 [2024-11-18 09:32:53,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 09:32:53,602 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2024-11-18 09:32:53,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 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-18 09:32:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2024-11-18 09:32:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-18 09:32:53,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 09:32:53,603 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 09:32:53,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-18 09:32:53,804 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-18 09:32:53,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 09:32:53,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 09:32:53,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1777786732, now seen corresponding path program 1 times [2024-11-18 09:32:53,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 09:32:53,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234660902] [2024-11-18 09:32:53,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 09:32:53,807 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-18 09:32:53,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 09:32:53,808 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-18 09:32:53,809 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-18 09:32:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 09:32:53,834 WARN L253 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-18 09:32:53,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 09:32:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 09:32:54,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 09:33:21,836 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-18 09:33:21,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 09:33:21,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234660902] [2024-11-18 09:33:21,838 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 101 [2024-11-18 09:33:21,838 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-18 09:33:21,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-18 09:33:22,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 09:33:22,039 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-11-18 09:33:22,044 INFO L158 Benchmark]: Toolchain (without parser) took 43195.40ms. Allocated memory was 81.8MB in the beginning and 174.1MB in the end (delta: 92.3MB). Free memory was 48.7MB in the beginning and 81.6MB in the end (delta: -32.9MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2024-11-18 09:33:22,044 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 56.6MB. Free memory was 35.1MB in the beginning and 35.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 09:33:22,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.11ms. Allocated memory is still 81.8MB. Free memory was 48.5MB in the beginning and 56.1MB in the end (delta: -7.6MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-11-18 09:33:22,045 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.69ms. Allocated memory is still 81.8MB. Free memory was 56.1MB in the beginning and 54.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:33:22,045 INFO L158 Benchmark]: Boogie Preprocessor took 33.22ms. Allocated memory is still 81.8MB. Free memory was 54.8MB in the beginning and 53.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 09:33:22,048 INFO L158 Benchmark]: RCFGBuilder took 220.46ms. Allocated memory is still 81.8MB. Free memory was 52.7MB in the beginning and 42.9MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 09:33:22,049 INFO L158 Benchmark]: TraceAbstraction took 42681.34ms. Allocated memory was 81.8MB in the beginning and 174.1MB in the end (delta: 92.3MB). Free memory was 42.2MB in the beginning and 81.6MB in the end (delta: -39.4MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-11-18 09:33:22,050 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.84ms. Allocated memory is still 56.6MB. Free memory was 35.1MB in the beginning and 35.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.11ms. Allocated memory is still 81.8MB. Free memory was 48.5MB in the beginning and 56.1MB in the end (delta: -7.6MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.69ms. Allocated memory is still 81.8MB. Free memory was 56.1MB in the beginning and 54.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.22ms. Allocated memory is still 81.8MB. Free memory was 54.8MB in the beginning and 53.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 220.46ms. Allocated memory is still 81.8MB. Free memory was 52.7MB in the beginning and 42.9MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 42681.34ms. Allocated memory was 81.8MB in the beginning and 174.1MB in the end (delta: 92.3MB). Free memory was 42.2MB in the beginning and 81.6MB in the end (delta: -39.4MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")