./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i --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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i -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 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:15:56,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:15:56,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 22:15:56,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:15:56,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:15:56,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:15:56,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:15:56,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:15:56,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:15:56,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:15:56,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:15:56,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:15:56,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:15:56,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:15:56,292 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:15:56,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:15:56,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:15:56,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:15:56,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 22:15:56,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:15:56,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:15:56,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:15:56,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:15:56,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:15:56,295 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:15:56,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:15:56,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:15:56,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:15:56,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:15:56,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:15:56,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:15:56,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:15:56,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:15:56,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:15:56,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:15:56,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:15:56,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 22:15:56,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 22:15:56,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:15:56,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:15:56,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:15:56,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:15:56,300 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 -> 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 [2024-11-18 22:15:56,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:15:56,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:15:56,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:15:56,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:15:56,570 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:15:56,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-18 22:15:57,810 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:15:57,968 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:15:57,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-18 22:15:57,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21aefd404/fbf781a1c5f74f519a90f0032659390f/FLAGd67bcff8d [2024-11-18 22:15:58,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21aefd404/fbf781a1c5f74f519a90f0032659390f [2024-11-18 22:15:58,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:15:58,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:15:58,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:15:58,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:15:58,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:15:58,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:15:58" (1/1) ... [2024-11-18 22:15:58,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@410376bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:58, skipping insertion in model container [2024-11-18 22:15:58,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:15:58" (1/1) ... [2024-11-18 22:15:58,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:15:58,542 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i[916,929] [2024-11-18 22:15:58,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:15:58,581 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:15:58,591 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i[916,929] [2024-11-18 22:15:58,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:15:58,619 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:15:58,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:58 WrapperNode [2024-11-18 22:15:58,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:15:58,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:15:58,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:15:58,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:15:58,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:58" (1/1) ... [2024-11-18 22:15:58,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:58" (1/1) ... [2024-11-18 22:15:58,657 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-11-18 22:15:58,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:15:58,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:15:58,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:15:58,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:15:58,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:58" (1/1) ... [2024-11-18 22:15:58,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:58" (1/1) ... [2024-11-18 22:15:58,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:58" (1/1) ... [2024-11-18 22:15:58,681 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 22:15:58,681 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:58" (1/1) ... [2024-11-18 22:15:58,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:58" (1/1) ... [2024-11-18 22:15:58,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:58" (1/1) ... [2024-11-18 22:15:58,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:58" (1/1) ... [2024-11-18 22:15:58,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:58" (1/1) ... [2024-11-18 22:15:58,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:58" (1/1) ... [2024-11-18 22:15:58,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:15:58,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:15:58,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:15:58,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:15:58,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:58" (1/1) ... [2024-11-18 22:15:58,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:15:58,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:15:58,727 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 22:15:58,730 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 22:15:58,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:15:58,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:15:58,766 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:15:58,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 22:15:58,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:15:58,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:15:58,828 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:15:58,829 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:15:59,092 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-18 22:15:59,093 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:15:59,112 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:15:59,112 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:15:59,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:15:59 BoogieIcfgContainer [2024-11-18 22:15:59,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:15:59,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:15:59,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:15:59,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:15:59,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:15:58" (1/3) ... [2024-11-18 22:15:59,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95757a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:15:59, skipping insertion in model container [2024-11-18 22:15:59,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:58" (2/3) ... [2024-11-18 22:15:59,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95757a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:15:59, skipping insertion in model container [2024-11-18 22:15:59,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:15:59" (3/3) ... [2024-11-18 22:15:59,123 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-18 22:15:59,138 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:15:59,138 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:15:59,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:15:59,194 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;@2f536757, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:15:59,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:15:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 22:15:59,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-18 22:15:59,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:15:59,206 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:15:59,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:15:59,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:15:59,210 INFO L85 PathProgramCache]: Analyzing trace with hash 911261099, now seen corresponding path program 1 times [2024-11-18 22:15:59,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:15:59,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368575855] [2024-11-18 22:15:59,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:15:59,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:15:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:15:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-18 22:15:59,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:15:59,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368575855] [2024-11-18 22:15:59,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368575855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:15:59,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305637915] [2024-11-18 22:15:59,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:15:59,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:15:59,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:15:59,444 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 22:15:59,445 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 22:15:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:15:59,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:15:59,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:15:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-18 22:15:59,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:15:59,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305637915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:15:59,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:15:59,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 22:15:59,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088380472] [2024-11-18 22:15:59,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:15:59,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:15:59,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:15:59,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:15:59,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:15:59,595 INFO L87 Difference]: Start difference. First operand has 55 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-18 22:15:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:15:59,613 INFO L93 Difference]: Finished difference Result 103 states and 168 transitions. [2024-11-18 22:15:59,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:15:59,614 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2024-11-18 22:15:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:15:59,620 INFO L225 Difference]: With dead ends: 103 [2024-11-18 22:15:59,620 INFO L226 Difference]: Without dead ends: 51 [2024-11-18 22:15:59,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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 22:15:59,625 INFO L432 NwaCegarLoop]: 73 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, 73 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 22:15:59,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:15:59,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-18 22:15:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-18 22:15:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 22:15:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-18 22:15:59,654 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 94 [2024-11-18 22:15:59,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:15:59,655 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-18 22:15:59,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-18 22:15:59,655 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-18 22:15:59,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-18 22:15:59,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:15:59,658 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:15:59,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 22:15:59,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 22:15:59,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:15:59,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:15:59,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2103931797, now seen corresponding path program 1 times [2024-11-18 22:15:59,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:15:59,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6145865] [2024-11-18 22:15:59,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:15:59,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:15:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 22:16:00,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:00,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6145865] [2024-11-18 22:16:00,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6145865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:00,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:00,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 22:16:00,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087057971] [2024-11-18 22:16:00,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:00,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 22:16:00,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:00,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 22:16:00,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:16:00,266 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:00,361 INFO L93 Difference]: Finished difference Result 145 states and 209 transitions. [2024-11-18 22:16:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:16:00,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-18 22:16:00,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:00,364 INFO L225 Difference]: With dead ends: 145 [2024-11-18 22:16:00,364 INFO L226 Difference]: Without dead ends: 97 [2024-11-18 22:16:00,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 22:16:00,366 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:00,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 439 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:16:00,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-18 22:16:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 53. [2024-11-18 22:16:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 22:16:00,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-18 22:16:00,384 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 94 [2024-11-18 22:16:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:00,385 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-18 22:16:00,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-18 22:16:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-18 22:16:00,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:00,389 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:00,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 22:16:00,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:00,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:00,390 INFO L85 PathProgramCache]: Analyzing trace with hash 148363339, now seen corresponding path program 1 times [2024-11-18 22:16:00,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:00,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044530280] [2024-11-18 22:16:00,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:00,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 22:16:00,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:00,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044530280] [2024-11-18 22:16:00,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044530280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:00,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:00,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 22:16:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885305663] [2024-11-18 22:16:00,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:00,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 22:16:00,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:00,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 22:16:00,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-18 22:16:00,758 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:00,906 INFO L93 Difference]: Finished difference Result 149 states and 212 transitions. [2024-11-18 22:16:00,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 22:16:00,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-11-18 22:16:00,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:00,908 INFO L225 Difference]: With dead ends: 149 [2024-11-18 22:16:00,909 INFO L226 Difference]: Without dead ends: 99 [2024-11-18 22:16:00,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-18 22:16:00,910 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 67 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:00,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 390 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:16:00,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-18 22:16:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 51. [2024-11-18 22:16:00,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 22:16:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2024-11-18 22:16:00,921 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 95 [2024-11-18 22:16:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:00,922 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2024-11-18 22:16:00,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2024-11-18 22:16:00,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-18 22:16:00,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:00,924 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:00,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 22:16:00,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:00,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:00,925 INFO L85 PathProgramCache]: Analyzing trace with hash 502683334, now seen corresponding path program 1 times [2024-11-18 22:16:00,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:00,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954492438] [2024-11-18 22:16:00,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:00,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-18 22:16:01,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:01,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954492438] [2024-11-18 22:16:01,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954492438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:01,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:01,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 22:16:01,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685137311] [2024-11-18 22:16:01,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:01,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 22:16:01,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:01,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 22:16:01,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 22:16:01,306 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:01,434 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2024-11-18 22:16:01,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 22:16:01,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2024-11-18 22:16:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:01,436 INFO L225 Difference]: With dead ends: 105 [2024-11-18 22:16:01,437 INFO L226 Difference]: Without dead ends: 57 [2024-11-18 22:16:01,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 22:16:01,439 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 73 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:01,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 134 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:16:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-18 22:16:01,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-11-18 22:16:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 22:16:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2024-11-18 22:16:01,451 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 96 [2024-11-18 22:16:01,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:01,452 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2024-11-18 22:16:01,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2024-11-18 22:16:01,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-18 22:16:01,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:01,454 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:01,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 22:16:01,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:01,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:01,457 INFO L85 PathProgramCache]: Analyzing trace with hash 294791846, now seen corresponding path program 1 times [2024-11-18 22:16:01,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:01,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522650917] [2024-11-18 22:16:01,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:01,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 22:16:01,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558930231] [2024-11-18 22:16:01,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:01,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:16:01,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:16:01,495 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 22:16:01,496 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 22:16:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:01,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-18 22:16:01,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:16:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-18 22:16:02,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:16:02,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:02,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522650917] [2024-11-18 22:16:02,420 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-18 22:16:02,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558930231] [2024-11-18 22:16:02,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558930231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:02,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:02,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-18 22:16:02,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126303021] [2024-11-18 22:16:02,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:02,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-18 22:16:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:02,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-18 22:16:02,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-18 22:16:02,424 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:02,862 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2024-11-18 22:16:02,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-18 22:16:02,863 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-18 22:16:02,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:02,864 INFO L225 Difference]: With dead ends: 97 [2024-11-18 22:16:02,864 INFO L226 Difference]: Without dead ends: 95 [2024-11-18 22:16:02,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-18 22:16:02,865 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 139 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:02,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 222 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 22:16:02,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-18 22:16:02,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2024-11-18 22:16:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 22:16:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2024-11-18 22:16:02,872 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 97 [2024-11-18 22:16:02,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:02,872 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2024-11-18 22:16:02,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2024-11-18 22:16:02,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-18 22:16:02,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:02,874 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:02,887 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 22:16:03,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:16:03,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:03,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:03,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2032362108, now seen corresponding path program 1 times [2024-11-18 22:16:03,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:03,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616088284] [2024-11-18 22:16:03,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:03,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 22:16:03,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:03,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616088284] [2024-11-18 22:16:03,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616088284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:03,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:03,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:16:03,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681723979] [2024-11-18 22:16:03,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:03,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:16:03,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:03,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:16:03,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:16:03,128 INFO L87 Difference]: Start difference. First operand 68 states and 89 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:03,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:03,151 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2024-11-18 22:16:03,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:16:03,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-18 22:16:03,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:03,153 INFO L225 Difference]: With dead ends: 151 [2024-11-18 22:16:03,155 INFO L226 Difference]: Without dead ends: 86 [2024-11-18 22:16:03,155 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 22:16:03,156 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 16 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:03,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 119 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:16:03,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-18 22:16:03,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2024-11-18 22:16:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 22:16:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2024-11-18 22:16:03,170 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 98 [2024-11-18 22:16:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:03,170 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2024-11-18 22:16:03,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2024-11-18 22:16:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-18 22:16:03,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:03,172 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:03,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 22:16:03,172 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:03,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:03,173 INFO L85 PathProgramCache]: Analyzing trace with hash -39747269, now seen corresponding path program 1 times [2024-11-18 22:16:03,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:03,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103711114] [2024-11-18 22:16:03,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:03,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 22:16:03,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101924675] [2024-11-18 22:16:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:03,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:16:03,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:16:03,240 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 22:16:03,242 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 22:16:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:03,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-18 22:16:03,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:16:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-18 22:16:04,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:16:04,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:04,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103711114] [2024-11-18 22:16:04,140 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-18 22:16:04,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101924675] [2024-11-18 22:16:04,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101924675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:04,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:04,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-18 22:16:04,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824386906] [2024-11-18 22:16:04,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:04,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-18 22:16:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:04,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-18 22:16:04,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-18 22:16:04,142 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-18 22:16:04,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:04,577 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2024-11-18 22:16:04,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-18 22:16:04,578 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 98 [2024-11-18 22:16:04,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:04,578 INFO L225 Difference]: With dead ends: 99 [2024-11-18 22:16:04,578 INFO L226 Difference]: Without dead ends: 97 [2024-11-18 22:16:04,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2024-11-18 22:16:04,579 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 133 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:04,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 246 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 22:16:04,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-18 22:16:04,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2024-11-18 22:16:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 22:16:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2024-11-18 22:16:04,593 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 98 [2024-11-18 22:16:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:04,593 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2024-11-18 22:16:04,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-18 22:16:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2024-11-18 22:16:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-18 22:16:04,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:04,595 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:04,609 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 22:16:04,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:16:04,796 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:04,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:04,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1296140404, now seen corresponding path program 1 times [2024-11-18 22:16:04,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:04,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895390719] [2024-11-18 22:16:04,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:04,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 22:16:04,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1621957408] [2024-11-18 22:16:04,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:04,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:16:04,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:16:04,822 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 22:16:04,823 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 22:16:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:04,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-18 22:16:04,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:16:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-18 22:16:05,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:16:05,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:05,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895390719] [2024-11-18 22:16:05,941 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-18 22:16:05,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621957408] [2024-11-18 22:16:05,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621957408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:05,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:05,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-18 22:16:05,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105278907] [2024-11-18 22:16:05,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:05,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-18 22:16:05,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:05,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-18 22:16:05,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-18 22:16:05,943 INFO L87 Difference]: Start difference. First operand 79 states and 103 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:06,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:06,866 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2024-11-18 22:16:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-18 22:16:06,867 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-18 22:16:06,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:06,869 INFO L225 Difference]: With dead ends: 120 [2024-11-18 22:16:06,869 INFO L226 Difference]: Without dead ends: 118 [2024-11-18 22:16:06,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-11-18 22:16:06,870 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 106 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:06,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 314 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 22:16:06,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-18 22:16:06,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 81. [2024-11-18 22:16:06,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 22:16:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2024-11-18 22:16:06,876 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 98 [2024-11-18 22:16:06,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:06,876 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2024-11-18 22:16:06,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2024-11-18 22:16:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-18 22:16:06,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:06,877 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:06,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-18 22:16:07,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:16:07,077 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:07,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash 285023154, now seen corresponding path program 1 times [2024-11-18 22:16:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:07,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939532925] [2024-11-18 22:16:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:07,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 22:16:07,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:07,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939532925] [2024-11-18 22:16:07,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939532925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:07,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:07,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 22:16:07,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478571781] [2024-11-18 22:16:07,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:07,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 22:16:07,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:07,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 22:16:07,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-18 22:16:07,428 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:07,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:07,570 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2024-11-18 22:16:07,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 22:16:07,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-18 22:16:07,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:07,571 INFO L225 Difference]: With dead ends: 149 [2024-11-18 22:16:07,571 INFO L226 Difference]: Without dead ends: 147 [2024-11-18 22:16:07,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-18 22:16:07,572 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 79 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:07,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 443 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:16:07,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-18 22:16:07,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2024-11-18 22:16:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.18348623853211) internal successors, (129), 110 states have internal predecessors, (129), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 22:16:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 165 transitions. [2024-11-18 22:16:07,579 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 165 transitions. Word has length 98 [2024-11-18 22:16:07,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:07,580 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 165 transitions. [2024-11-18 22:16:07,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:07,580 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 165 transitions. [2024-11-18 22:16:07,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-18 22:16:07,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:07,581 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:07,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 22:16:07,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:07,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:07,581 INFO L85 PathProgramCache]: Analyzing trace with hash 307006281, now seen corresponding path program 1 times [2024-11-18 22:16:07,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:07,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200030061] [2024-11-18 22:16:07,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:07,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 22:16:07,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:07,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200030061] [2024-11-18 22:16:07,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200030061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:07,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:07,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:16:07,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322794963] [2024-11-18 22:16:07,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:07,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:16:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:07,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:16:07,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:16:07,636 INFO L87 Difference]: Start difference. First operand 131 states and 165 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:07,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:07,659 INFO L93 Difference]: Finished difference Result 277 states and 346 transitions. [2024-11-18 22:16:07,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:16:07,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-18 22:16:07,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:07,661 INFO L225 Difference]: With dead ends: 277 [2024-11-18 22:16:07,661 INFO L226 Difference]: Without dead ends: 149 [2024-11-18 22:16:07,661 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 22:16:07,662 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 15 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:07,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:16:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-18 22:16:07,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2024-11-18 22:16:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.1559633027522935) internal successors, (126), 110 states have internal predecessors, (126), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 22:16:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2024-11-18 22:16:07,669 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 98 [2024-11-18 22:16:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:07,669 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2024-11-18 22:16:07,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2024-11-18 22:16:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-18 22:16:07,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:07,670 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:07,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 22:16:07,670 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:07,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:07,671 INFO L85 PathProgramCache]: Analyzing trace with hash 937286957, now seen corresponding path program 1 times [2024-11-18 22:16:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:07,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001088235] [2024-11-18 22:16:07,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 22:16:07,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1357304398] [2024-11-18 22:16:07,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:07,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:16:07,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:16:07,696 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 22:16:07,698 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 22:16:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:07,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-18 22:16:07,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:16:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-18 22:16:08,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:16:08,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001088235] [2024-11-18 22:16:08,788 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-18 22:16:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357304398] [2024-11-18 22:16:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357304398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:08,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:08,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-18 22:16:08,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651215462] [2024-11-18 22:16:08,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:08,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-18 22:16:08,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:08,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-18 22:16:08,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-18 22:16:08,790 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-18 22:16:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:09,882 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2024-11-18 22:16:09,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 22:16:09,882 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 99 [2024-11-18 22:16:09,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:09,883 INFO L225 Difference]: With dead ends: 168 [2024-11-18 22:16:09,883 INFO L226 Difference]: Without dead ends: 166 [2024-11-18 22:16:09,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2024-11-18 22:16:09,884 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 100 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:09,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 312 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 22:16:09,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-18 22:16:09,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 122. [2024-11-18 22:16:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.15) internal successors, (115), 101 states have internal predecessors, (115), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 22:16:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2024-11-18 22:16:09,890 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 99 [2024-11-18 22:16:09,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:09,891 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2024-11-18 22:16:09,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-18 22:16:09,891 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2024-11-18 22:16:09,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-18 22:16:09,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:09,892 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:09,904 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 22:16:10,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-18 22:16:10,093 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:10,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:10,093 INFO L85 PathProgramCache]: Analyzing trace with hash -342576721, now seen corresponding path program 1 times [2024-11-18 22:16:10,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:10,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046161708] [2024-11-18 22:16:10,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:10,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 22:16:10,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:10,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046161708] [2024-11-18 22:16:10,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046161708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:10,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:10,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-18 22:16:10,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019116295] [2024-11-18 22:16:10,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:10,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 22:16:10,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:10,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 22:16:10,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-18 22:16:10,665 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:10,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:10,854 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2024-11-18 22:16:10,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 22:16:10,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2024-11-18 22:16:10,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:10,855 INFO L225 Difference]: With dead ends: 138 [2024-11-18 22:16:10,855 INFO L226 Difference]: Without dead ends: 136 [2024-11-18 22:16:10,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-18 22:16:10,856 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 66 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:10,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 491 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 22:16:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-18 22:16:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2024-11-18 22:16:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 84 states have internal predecessors, (97), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 22:16:10,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2024-11-18 22:16:10,862 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 99 [2024-11-18 22:16:10,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:10,862 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2024-11-18 22:16:10,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2024-11-18 22:16:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-18 22:16:10,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:10,863 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:10,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 22:16:10,863 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:10,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:10,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1653714623, now seen corresponding path program 1 times [2024-11-18 22:16:10,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:10,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561820017] [2024-11-18 22:16:10,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:10,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 22:16:10,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2111497898] [2024-11-18 22:16:10,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:10,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:16:10,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:16:10,883 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:16:10,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 22:16:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:16:10,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 22:16:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:16:10,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 22:16:10,989 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 22:16:10,990 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 22:16:11,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 22:16:11,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:16:11,198 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:11,262 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 22:16:11,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:16:11 BoogieIcfgContainer [2024-11-18 22:16:11,268 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 22:16:11,268 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 22:16:11,268 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 22:16:11,268 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 22:16:11,269 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:15:59" (3/4) ... [2024-11-18 22:16:11,271 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 22:16:11,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 22:16:11,272 INFO L158 Benchmark]: Toolchain (without parser) took 12891.16ms. Allocated memory was 165.7MB in the beginning and 346.0MB in the end (delta: 180.4MB). Free memory was 129.8MB in the beginning and 279.8MB in the end (delta: -150.0MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-18 22:16:11,272 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:16:11,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.66ms. Allocated memory is still 165.7MB. Free memory was 129.8MB in the beginning and 116.2MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 22:16:11,272 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.84ms. Allocated memory is still 165.7MB. Free memory was 116.2MB in the beginning and 114.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:16:11,273 INFO L158 Benchmark]: Boogie Preprocessor took 34.51ms. Allocated memory is still 165.7MB. Free memory was 114.1MB in the beginning and 110.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:16:11,273 INFO L158 Benchmark]: RCFGBuilder took 418.83ms. Allocated memory is still 165.7MB. Free memory was 110.9MB in the beginning and 128.3MB in the end (delta: -17.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 22:16:11,273 INFO L158 Benchmark]: TraceAbstraction took 12152.56ms. Allocated memory was 165.7MB in the beginning and 346.0MB in the end (delta: 180.4MB). Free memory was 127.3MB in the beginning and 280.8MB in the end (delta: -153.5MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-11-18 22:16:11,273 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 346.0MB. Free memory was 280.8MB in the beginning and 279.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:16:11,275 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.15ms. Allocated memory is still 117.4MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.66ms. Allocated memory is still 165.7MB. Free memory was 129.8MB in the beginning and 116.2MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.84ms. Allocated memory is still 165.7MB. Free memory was 116.2MB in the beginning and 114.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.51ms. Allocated memory is still 165.7MB. Free memory was 114.1MB in the beginning and 110.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 418.83ms. Allocated memory is still 165.7MB. Free memory was 110.9MB in the beginning and 128.3MB in the end (delta: -17.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12152.56ms. Allocated memory was 165.7MB in the beginning and 346.0MB in the end (delta: 180.4MB). Free memory was 127.3MB in the beginning and 280.8MB in the end (delta: -153.5MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 346.0MB. Free memory was 280.8MB in the beginning and 279.8MB in the end (delta: 1.0MB). 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: 19]: 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 shiftRight at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] signed char var_1_3 = 0; [L24] signed char var_1_4 = 64; [L25] signed char var_1_5 = 64; [L26] signed long int var_1_6 = -64; [L27] signed long int var_1_8 = 32; [L28] signed long int var_1_9 = 1; [L29] unsigned short int var_1_10 = 32; [L30] signed long int var_1_11 = 15; [L31] unsigned char var_1_12 = 0; [L32] unsigned char var_1_13 = 0; [L33] unsigned short int last_1_var_1_10 = 32; VAL [isInitial=0, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L88] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_char() [L66] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L66] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L67] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L67] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L68] var_1_4 = __VERIFIER_nondet_char() [L69] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L69] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L70] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L71] var_1_5 = __VERIFIER_nondet_char() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L73] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L74] var_1_8 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L75] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L76] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L77] var_1_9 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L78] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L79] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L79] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L80] var_1_11 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L81] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L82] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L82] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L83] var_1_13 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L84] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L85] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L85] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L99] RET updateVariables() [L100] CALL step() [L37] signed long int stepLocal_0 = (((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10)); VAL [isInitial=1, last_1_var_1_10=32, stepLocal_0=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L38] EXPR last_1_var_1_10 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_0=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L38] COND FALSE !(stepLocal_0 <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) [L45] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L47] signed long int stepLocal_1 = var_1_5 + var_1_6; VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L48] COND FALSE !(var_1_11 < var_1_9) VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L55] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L56] COND TRUE ! var_1_12 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L57] COND TRUE ! var_1_12 [L58] var_1_1 = (var_1_3 + -32) VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR ((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L91] EXPR last_1_var_1_10 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L91] EXPR ((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L91-L92] return ((((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5)))) && ((var_1_11 < var_1_9) ? (((var_1_5 + var_1_6) <= (~ (var_1_6 % -32))) ? (var_1_10 == ((unsigned short int) var_1_5)) : (var_1_10 == ((unsigned short int) var_1_5))) : 1)) && (var_1_12 == ((unsigned char) var_1_13)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 13, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 918 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 858 mSDsluCounter, 3324 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2448 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2630 IncrementalHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 876 mSDtfsCounter, 2630 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=9, InterpolantAutomatonStates: 118, 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, 12 MinimizatonAttempts, 293 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1848 NumberOfCodeBlocks, 1848 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1245 ConstructedInterpolants, 2 QuantifiedInterpolants, 4422 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1144 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 4706/4732 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 22:16:11,303 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i -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 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:16:13,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:16:13,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 22:16:13,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:16:13,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:16:13,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:16:13,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:16:13,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:16:13,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:16:13,202 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:16:13,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:16:13,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:16:13,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:16:13,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:16:13,203 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:16:13,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:16:13,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:16:13,204 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:16:13,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:16:13,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:16:13,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:16:13,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:16:13,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:16:13,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 22:16:13,207 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 22:16:13,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:16:13,207 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 22:16:13,207 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:16:13,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:16:13,208 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:16:13,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:16:13,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:16:13,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:16:13,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:16:13,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:16:13,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:16:13,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:16:13,210 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:16:13,210 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 22:16:13,210 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 22:16:13,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:16:13,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:16:13,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:16:13,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:16:13,211 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 -> 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 [2024-11-18 22:16:13,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:16:13,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:16:13,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:16:13,485 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:16:13,486 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:16:13,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-18 22:16:14,730 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:16:14,888 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:16:14,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-18 22:16:14,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1791cf9/7ccd0eb1bc0148e6bb77421f79fbc9d8/FLAG0bc03cca7 [2024-11-18 22:16:14,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1791cf9/7ccd0eb1bc0148e6bb77421f79fbc9d8 [2024-11-18 22:16:14,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:16:14,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:16:14,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:16:14,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:16:14,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:16:14,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:16:14" (1/1) ... [2024-11-18 22:16:14,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae2f2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:14, skipping insertion in model container [2024-11-18 22:16:14,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:16:14" (1/1) ... [2024-11-18 22:16:14,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:16:15,111 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i[916,929] [2024-11-18 22:16:15,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:16:15,159 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:16:15,168 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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i[916,929] [2024-11-18 22:16:15,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:16:15,216 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:16:15,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:15 WrapperNode [2024-11-18 22:16:15,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:16:15,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:16:15,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:16:15,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:16:15,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:15" (1/1) ... [2024-11-18 22:16:15,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:15" (1/1) ... [2024-11-18 22:16:15,265 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-11-18 22:16:15,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:16:15,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:16:15,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:16:15,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:16:15,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:15" (1/1) ... [2024-11-18 22:16:15,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:15" (1/1) ... [2024-11-18 22:16:15,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:15" (1/1) ... [2024-11-18 22:16:15,296 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 22:16:15,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:15" (1/1) ... [2024-11-18 22:16:15,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:15" (1/1) ... [2024-11-18 22:16:15,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:15" (1/1) ... [2024-11-18 22:16:15,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:15" (1/1) ... [2024-11-18 22:16:15,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:15" (1/1) ... [2024-11-18 22:16:15,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:15" (1/1) ... [2024-11-18 22:16:15,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:16:15,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:16:15,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:16:15,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:16:15,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:15" (1/1) ... [2024-11-18 22:16:15,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:16:15,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:16:15,347 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 22:16:15,350 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 22:16:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:16:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 22:16:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:16:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:16:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:16:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:16:15,455 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:16:15,458 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:16:15,681 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-18 22:16:15,681 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:16:15,693 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:16:15,694 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:16:15,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:16:15 BoogieIcfgContainer [2024-11-18 22:16:15,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:16:15,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:16:15,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:16:15,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:16:15,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:16:14" (1/3) ... [2024-11-18 22:16:15,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe1fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:16:15, skipping insertion in model container [2024-11-18 22:16:15,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:15" (2/3) ... [2024-11-18 22:16:15,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe1fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:16:15, skipping insertion in model container [2024-11-18 22:16:15,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:16:15" (3/3) ... [2024-11-18 22:16:15,702 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-18 22:16:15,714 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:16:15,715 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:16:15,763 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:16:15,768 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;@57afadc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:16:15,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:16:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 22:16:15,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-18 22:16:15,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:15,783 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:15,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:15,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:15,787 INFO L85 PathProgramCache]: Analyzing trace with hash 416337941, now seen corresponding path program 1 times [2024-11-18 22:16:15,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:16:15,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34512958] [2024-11-18 22:16:15,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:15,800 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 22:16:15,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:16:15,803 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 22:16:15,804 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 22:16:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:15,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:16:15,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:16:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-18 22:16:15,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:16:15,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:16:15,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34512958] [2024-11-18 22:16:15,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34512958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:15,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:15,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 22:16:15,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145420506] [2024-11-18 22:16:15,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:15,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:16:15,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:16:15,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:16:15,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:16:15,992 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-18 22:16:16,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:16,026 INFO L93 Difference]: Finished difference Result 89 states and 148 transitions. [2024-11-18 22:16:16,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:16:16,028 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2024-11-18 22:16:16,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:16,035 INFO L225 Difference]: With dead ends: 89 [2024-11-18 22:16:16,036 INFO L226 Difference]: Without dead ends: 44 [2024-11-18 22:16:16,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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 22:16:16,043 INFO L432 NwaCegarLoop]: 63 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, 63 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 22:16:16,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:16:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-18 22:16:16,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-18 22:16:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 22:16:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2024-11-18 22:16:16,084 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 91 [2024-11-18 22:16:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:16,084 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2024-11-18 22:16:16,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-18 22:16:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2024-11-18 22:16:16,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-18 22:16:16,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:16,088 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:16,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-18 22:16:16,289 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 22:16:16,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:16,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:16,291 INFO L85 PathProgramCache]: Analyzing trace with hash 410614101, now seen corresponding path program 1 times [2024-11-18 22:16:16,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:16:16,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317951996] [2024-11-18 22:16:16,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:16,292 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 22:16:16,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:16:16,294 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 22:16:16,295 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 22:16:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:16,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 22:16:16,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:16:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-18 22:16:16,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:16:16,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:16:16,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317951996] [2024-11-18 22:16:16,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317951996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:16,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:16,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 22:16:16,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841637264] [2024-11-18 22:16:16,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:16,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 22:16:16,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:16:16,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 22:16:16,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 22:16:16,477 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:16,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:16,694 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2024-11-18 22:16:16,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 22:16:16,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-11-18 22:16:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:16,699 INFO L225 Difference]: With dead ends: 93 [2024-11-18 22:16:16,700 INFO L226 Difference]: Without dead ends: 52 [2024-11-18 22:16:16,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-18 22:16:16,701 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 67 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:16,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 96 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:16:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-18 22:16:16,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2024-11-18 22:16:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 22:16:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-11-18 22:16:16,721 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 91 [2024-11-18 22:16:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:16,722 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-11-18 22:16:16,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-11-18 22:16:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-18 22:16:16,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:16,726 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:16,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-18 22:16:16,926 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 22:16:16,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:16,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:16,927 INFO L85 PathProgramCache]: Analyzing trace with hash -391425056, now seen corresponding path program 1 times [2024-11-18 22:16:16,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:16:16,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919911719] [2024-11-18 22:16:16,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:16,928 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 22:16:16,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:16:16,931 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 22:16:16,931 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 22:16:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:17,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-18 22:16:17,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:16:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-18 22:16:35,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:16:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 22:16:50,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:16:50,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919911719] [2024-11-18 22:16:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919911719] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 22:16:50,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:16:50,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2024-11-18 22:16:50,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40805633] [2024-11-18 22:16:50,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:50,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 22:16:50,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:16:50,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 22:16:50,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-11-18 22:16:50,787 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:52,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-18 22:16:57,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:57,485 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2024-11-18 22:16:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 22:16:57,488 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-11-18 22:16:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:57,490 INFO L225 Difference]: With dead ends: 61 [2024-11-18 22:16:57,490 INFO L226 Difference]: Without dead ends: 59 [2024-11-18 22:16:57,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2024-11-18 22:16:57,491 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 19 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:57,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 267 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-18 22:16:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-18 22:16:57,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-11-18 22:16:57,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 22:16:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2024-11-18 22:16:57,500 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 92 [2024-11-18 22:16:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:57,500 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2024-11-18 22:16:57,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-18 22:16:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2024-11-18 22:16:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-18 22:16:57,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:57,502 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:57,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-18 22:16:57,703 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 22:16:57,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:57,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:57,705 INFO L85 PathProgramCache]: Analyzing trace with hash 78612323, now seen corresponding path program 1 times [2024-11-18 22:16:57,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:16:57,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275718520] [2024-11-18 22:16:57,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:57,705 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 22:16:57,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:16:57,708 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 22:16:57,709 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 22:16:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:57,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-18 22:16:57,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:17:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-18 22:17:08,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:17:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-18 22:17:18,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:17:18,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275718520] [2024-11-18 22:17:18,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275718520] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 22:17:18,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:17:18,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2024-11-18 22:17:18,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257352995] [2024-11-18 22:17:18,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:17:18,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 22:17:18,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:17:18,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 22:17:18,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-18 22:17:18,111 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)