./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 c7c6ca5d 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-?-c7c6ca5-m [2024-11-08 23:13:25,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:13:26,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:13:26,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:13:26,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:13:26,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:13:26,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:13:26,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:13:26,062 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:13:26,063 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:13:26,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:13:26,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:13:26,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:13:26,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:13:26,065 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:13:26,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:13:26,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:13:26,068 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:13:26,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:13:26,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:13:26,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:13:26,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:13:26,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:13:26,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:13:26,072 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:13:26,072 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:13:26,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:13:26,073 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:13:26,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:13:26,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:13:26,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:13:26,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:13:26,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:13:26,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:13:26,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:13:26,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:13:26,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:13:26,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:13:26,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:13:26,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:13:26,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:13:26,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:13:26,078 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-08 23:13:26,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:13:26,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:13:26,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:13:26,367 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:13:26,367 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:13:26,368 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-08 23:13:27,718 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:13:27,853 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:13:27,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-08 23:13:27,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2162f6ebc/7ad92b1e725543edb5a6d0d77f8a445a/FLAG82c5a2334 [2024-11-08 23:13:27,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2162f6ebc/7ad92b1e725543edb5a6d0d77f8a445a [2024-11-08 23:13:27,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:13:27,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:13:27,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:13:27,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:13:27,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:13:27,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:13:27" (1/1) ... [2024-11-08 23:13:27,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2fbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:27, skipping insertion in model container [2024-11-08 23:13:27,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:13:27" (1/1) ... [2024-11-08 23:13:27,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:13:28,089 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-08 23:13:28,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:13:28,133 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:13:28,146 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-08 23:13:28,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:13:28,182 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:13:28,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:28 WrapperNode [2024-11-08 23:13:28,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:13:28,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:13:28,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:13:28,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:13:28,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:28" (1/1) ... [2024-11-08 23:13:28,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:28" (1/1) ... [2024-11-08 23:13:28,211 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-11-08 23:13:28,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:13:28,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:13:28,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:13:28,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:13:28,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:28" (1/1) ... [2024-11-08 23:13:28,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:28" (1/1) ... [2024-11-08 23:13:28,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:28" (1/1) ... [2024-11-08 23:13:28,239 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-08 23:13:28,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:28" (1/1) ... [2024-11-08 23:13:28,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:28" (1/1) ... [2024-11-08 23:13:28,250 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:28" (1/1) ... [2024-11-08 23:13:28,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:28" (1/1) ... [2024-11-08 23:13:28,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:28" (1/1) ... [2024-11-08 23:13:28,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:28" (1/1) ... [2024-11-08 23:13:28,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:13:28,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:13:28,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:13:28,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:13:28,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:28" (1/1) ... [2024-11-08 23:13:28,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:13:28,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:13:28,293 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-08 23:13:28,301 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-08 23:13:28,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:13:28,341 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:13:28,341 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:13:28,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:13:28,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:13:28,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:13:28,404 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:13:28,408 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:13:28,629 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 23:13:28,629 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:13:28,644 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:13:28,645 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:13:28,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:13:28 BoogieIcfgContainer [2024-11-08 23:13:28,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:13:28,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:13:28,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:13:28,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:13:28,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:13:27" (1/3) ... [2024-11-08 23:13:28,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3010a896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:13:28, skipping insertion in model container [2024-11-08 23:13:28,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:28" (2/3) ... [2024-11-08 23:13:28,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3010a896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:13:28, skipping insertion in model container [2024-11-08 23:13:28,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:13:28" (3/3) ... [2024-11-08 23:13:28,654 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-08 23:13:28,670 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:13:28,670 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:13:28,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:13:28,731 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;@356e2c77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:13:28,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:13:28,734 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-08 23:13:28,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 23:13:28,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:28,743 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-08 23:13:28,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:28,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:28,748 INFO L85 PathProgramCache]: Analyzing trace with hash 911261099, now seen corresponding path program 1 times [2024-11-08 23:13:28,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:13:28,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84507963] [2024-11-08 23:13:28,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:28,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:13:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:13:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:28,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:13:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:28,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:13:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:28,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:13:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:13:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:13:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:13:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:13:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:13:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:13:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:13:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:13:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:13:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:13:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,033 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-08 23:13:29,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:13:29,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84507963] [2024-11-08 23:13:29,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84507963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:29,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:29,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:13:29,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206232751] [2024-11-08 23:13:29,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:29,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:13:29,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:13:29,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:13:29,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:13:29,064 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 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-08 23:13:29,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:29,087 INFO L93 Difference]: Finished difference Result 103 states and 168 transitions. [2024-11-08 23:13:29,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:13:29,089 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 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-08 23:13:29,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:29,095 INFO L225 Difference]: With dead ends: 103 [2024-11-08 23:13:29,095 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 23:13:29,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-08 23:13:29,100 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-08 23:13:29,101 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-08 23:13:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 23:13:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 23:13:29,125 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-08 23:13:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-08 23:13:29,131 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 94 [2024-11-08 23:13:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:29,131 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-08 23:13:29,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 1 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-08 23:13:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-08 23:13:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 23:13:29,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:29,135 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-08 23:13:29,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:13:29,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:29,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:29,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2103931797, now seen corresponding path program 1 times [2024-11-08 23:13:29,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:13:29,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100173857] [2024-11-08 23:13:29,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:29,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:13:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:13:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:13:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:13:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:13:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:13:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:13:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:13:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:13:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:13:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:13:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:13:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:13:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:13:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:13:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:29,649 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-08 23:13:29,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:13:29,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100173857] [2024-11-08 23:13:29,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100173857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:29,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:29,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:13:29,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295267984] [2024-11-08 23:13:29,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:29,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:13:29,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:13:29,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:13:29,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:13:29,658 INFO L87 Difference]: Start difference. First operand 51 states and 73 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), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 23:13:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:29,748 INFO L93 Difference]: Finished difference Result 145 states and 209 transitions. [2024-11-08 23:13:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:13:29,748 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), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-08 23:13:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:29,752 INFO L225 Difference]: With dead ends: 145 [2024-11-08 23:13:29,753 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 23:13:29,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:13:29,755 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:13:29,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 565 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:13:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 23:13:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 53. [2024-11-08 23:13:29,768 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-08 23:13:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-08 23:13:29,771 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 94 [2024-11-08 23:13:29,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:29,773 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-08 23:13:29,774 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), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 23:13:29,774 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-08 23:13:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 23:13:29,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:29,778 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-08 23:13:29,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:13:29,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:29,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:29,779 INFO L85 PathProgramCache]: Analyzing trace with hash 148363339, now seen corresponding path program 1 times [2024-11-08 23:13:29,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:13:29,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596041916] [2024-11-08 23:13:29,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:29,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:13:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:13:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:13:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:13:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:13:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:13:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:13:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:13:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:13:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:13:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:13:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:13:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:13:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:13:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:13:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,081 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-08 23:13:30,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:13:30,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596041916] [2024-11-08 23:13:30,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596041916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:30,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:30,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:13:30,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297259046] [2024-11-08 23:13:30,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:30,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:13:30,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:13:30,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:13:30,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:13:30,086 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-08 23:13:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:30,239 INFO L93 Difference]: Finished difference Result 149 states and 212 transitions. [2024-11-08 23:13:30,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:13:30,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-08 23:13:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:30,241 INFO L225 Difference]: With dead ends: 149 [2024-11-08 23:13:30,241 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 23:13:30,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:13:30,242 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 67 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:13:30,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 315 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:13:30,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 23:13:30,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 51. [2024-11-08 23:13:30,251 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-08 23:13:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2024-11-08 23:13:30,254 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 95 [2024-11-08 23:13:30,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:30,255 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2024-11-08 23:13:30,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-08 23:13:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2024-11-08 23:13:30,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 23:13:30,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:30,258 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-08 23:13:30,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:13:30,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:30,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:30,260 INFO L85 PathProgramCache]: Analyzing trace with hash 502683334, now seen corresponding path program 1 times [2024-11-08 23:13:30,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:13:30,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799177323] [2024-11-08 23:13:30,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:30,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:13:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:13:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:13:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:13:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:13:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:13:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:13:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:13:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:13:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:13:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:13:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:13:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:13:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:13:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:13:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,613 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-08 23:13:30,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:13:30,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799177323] [2024-11-08 23:13:30,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799177323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:30,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:30,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:13:30,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725771564] [2024-11-08 23:13:30,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:30,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:13:30,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:13:30,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:13:30,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:13:30,615 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-08 23:13:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:30,734 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2024-11-08 23:13:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:13:30,734 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-08 23:13:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:30,735 INFO L225 Difference]: With dead ends: 105 [2024-11-08 23:13:30,735 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 23:13:30,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:13:30,737 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-08 23:13:30,737 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-08 23:13:30,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 23:13:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-11-08 23:13:30,742 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-08 23:13:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2024-11-08 23:13:30,748 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 96 [2024-11-08 23:13:30,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:30,748 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2024-11-08 23:13:30,748 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-08 23:13:30,748 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2024-11-08 23:13:30,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 23:13:30,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:30,749 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-08 23:13:30,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:13:30,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:30,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:30,750 INFO L85 PathProgramCache]: Analyzing trace with hash 294791846, now seen corresponding path program 1 times [2024-11-08 23:13:30,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:13:30,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271266306] [2024-11-08 23:13:30,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:30,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:13:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:13:30,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [940124737] [2024-11-08 23:13:30,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:30,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:13:30,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:13:30,776 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-08 23:13:30,780 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-08 23:13:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:30,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 23:13:30,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:13:31,633 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-08 23:13:31,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:13:31,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:13:31,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271266306] [2024-11-08 23:13:31,636 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:13:31,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940124737] [2024-11-08 23:13:31,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940124737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:31,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:31,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 23:13:31,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028811999] [2024-11-08 23:13:31,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:31,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 23:13:31,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:13:31,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 23:13:31,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-08 23:13:31,639 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-08 23:13:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:32,117 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2024-11-08 23:13:32,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 23:13:32,120 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-08 23:13:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:32,122 INFO L225 Difference]: With dead ends: 97 [2024-11-08 23:13:32,123 INFO L226 Difference]: Without dead ends: 95 [2024-11-08 23:13:32,124 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-08 23:13:32,125 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 114 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:13:32,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 230 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:13:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-08 23:13:32,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2024-11-08 23:13:32,137 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-08 23:13:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2024-11-08 23:13:32,138 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 97 [2024-11-08 23:13:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:32,139 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2024-11-08 23:13:32,139 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-08 23:13:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2024-11-08 23:13:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 23:13:32,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:32,140 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-08 23:13:32,157 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-08 23:13:32,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:13:32,347 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:32,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:32,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2032362108, now seen corresponding path program 1 times [2024-11-08 23:13:32,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:13:32,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36510765] [2024-11-08 23:13:32,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:32,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:13:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:13:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:13:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:13:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:13:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:13:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:13:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:13:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:13:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:13:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:13:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:13:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:13:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:13:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:13:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,440 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-08 23:13:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:13:32,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36510765] [2024-11-08 23:13:32,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36510765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:32,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:32,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:13:32,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402368885] [2024-11-08 23:13:32,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:32,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:13:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:13:32,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:13:32,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:13:32,444 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-08 23:13:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:32,469 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2024-11-08 23:13:32,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:13:32,470 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-08 23:13:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:32,471 INFO L225 Difference]: With dead ends: 151 [2024-11-08 23:13:32,472 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 23:13:32,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-08 23:13:32,473 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-08 23:13:32,475 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-08 23:13:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 23:13:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2024-11-08 23:13:32,484 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-08 23:13:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2024-11-08 23:13:32,486 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 98 [2024-11-08 23:13:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:32,486 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2024-11-08 23:13:32,487 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-08 23:13:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2024-11-08 23:13:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 23:13:32,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:32,488 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-08 23:13:32,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:13:32,489 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:32,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:32,489 INFO L85 PathProgramCache]: Analyzing trace with hash -39747269, now seen corresponding path program 1 times [2024-11-08 23:13:32,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:13:32,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447920290] [2024-11-08 23:13:32,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:32,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:13:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:13:32,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [59750993] [2024-11-08 23:13:32,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:32,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:13:32,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:13:32,541 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-08 23:13:32,551 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-08 23:13:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:32,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 23:13:32,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:13:33,517 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-08 23:13:33,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:13:33,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:13:33,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447920290] [2024-11-08 23:13:33,517 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:13:33,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59750993] [2024-11-08 23:13:33,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59750993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:33,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:33,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 23:13:33,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670325647] [2024-11-08 23:13:33,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:33,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 23:13:33,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:13:33,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 23:13:33,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-08 23:13:33,519 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-08 23:13:33,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:33,936 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2024-11-08 23:13:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 23:13:33,937 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-08 23:13:33,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:33,938 INFO L225 Difference]: With dead ends: 99 [2024-11-08 23:13:33,938 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 23:13:33,938 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-08 23:13:33,939 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 83 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:13:33,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 252 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:13:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 23:13:33,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2024-11-08 23:13:33,952 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-08 23:13:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2024-11-08 23:13:33,953 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 98 [2024-11-08 23:13:33,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:33,953 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2024-11-08 23:13:33,954 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-08 23:13:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2024-11-08 23:13:33,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 23:13:33,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:33,958 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-08 23:13:33,971 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-08 23:13:34,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 23:13:34,159 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:34,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:34,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1296140404, now seen corresponding path program 1 times [2024-11-08 23:13:34,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:13:34,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039415903] [2024-11-08 23:13:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:34,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:13:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:13:34,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413706681] [2024-11-08 23:13:34,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:34,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:13:34,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:13:34,180 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-08 23:13:34,182 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-08 23:13:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:34,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 23:13:34,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:13:35,414 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-08 23:13:35,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:13:35,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:13:35,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039415903] [2024-11-08 23:13:35,415 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:13:35,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413706681] [2024-11-08 23:13:35,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413706681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:35,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:35,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 23:13:35,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312282623] [2024-11-08 23:13:35,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:35,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 23:13:35,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:13:35,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 23:13:35,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-08 23:13:35,417 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-08 23:13:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:36,532 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2024-11-08 23:13:36,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 23:13:36,532 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-08 23:13:36,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:36,534 INFO L225 Difference]: With dead ends: 120 [2024-11-08 23:13:36,534 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 23:13:36,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-11-08 23:13:36,535 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 105 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:13:36,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 350 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 23:13:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 23:13:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 81. [2024-11-08 23:13:36,546 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-08 23:13:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2024-11-08 23:13:36,546 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 98 [2024-11-08 23:13:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:36,546 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2024-11-08 23:13:36,547 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-08 23:13:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2024-11-08 23:13:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 23:13:36,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:36,547 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-08 23:13:36,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 23:13:36,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:13:36,749 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:36,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:36,749 INFO L85 PathProgramCache]: Analyzing trace with hash 285023154, now seen corresponding path program 1 times [2024-11-08 23:13:36,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:13:36,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977466823] [2024-11-08 23:13:36,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:36,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:13:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:13:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:13:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:13:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:13:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:13:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:13:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:13:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:13:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:13:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:13:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:13:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:13:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:13:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:13:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,088 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-08 23:13:37,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:13:37,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977466823] [2024-11-08 23:13:37,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977466823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:37,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:37,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:13:37,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188965775] [2024-11-08 23:13:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:37,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:13:37,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:13:37,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:13:37,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:13:37,091 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-08 23:13:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:37,246 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2024-11-08 23:13:37,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:13:37,247 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-08 23:13:37,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:37,248 INFO L225 Difference]: With dead ends: 149 [2024-11-08 23:13:37,248 INFO L226 Difference]: Without dead ends: 147 [2024-11-08 23:13:37,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 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-08 23:13:37,249 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-08 23:13:37,250 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-08 23:13:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-08 23:13:37,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2024-11-08 23:13:37,261 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-08 23:13:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 165 transitions. [2024-11-08 23:13:37,262 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 165 transitions. Word has length 98 [2024-11-08 23:13:37,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:37,262 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 165 transitions. [2024-11-08 23:13:37,262 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-08 23:13:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 165 transitions. [2024-11-08 23:13:37,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 23:13:37,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:37,264 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-08 23:13:37,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 23:13:37,264 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:37,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:37,264 INFO L85 PathProgramCache]: Analyzing trace with hash 307006281, now seen corresponding path program 1 times [2024-11-08 23:13:37,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:13:37,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512272386] [2024-11-08 23:13:37,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:37,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:13:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:13:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:13:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:13:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:13:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:13:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:13:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:13:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:13:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:13:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:13:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:13:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:13:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:13:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:13:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,315 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-08 23:13:37,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:13:37,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512272386] [2024-11-08 23:13:37,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512272386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:37,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:37,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:13:37,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596496302] [2024-11-08 23:13:37,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:37,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:13:37,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:13:37,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:13:37,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:13:37,317 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-08 23:13:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:37,347 INFO L93 Difference]: Finished difference Result 277 states and 346 transitions. [2024-11-08 23:13:37,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:13:37,348 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-08 23:13:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:37,351 INFO L225 Difference]: With dead ends: 277 [2024-11-08 23:13:37,352 INFO L226 Difference]: Without dead ends: 149 [2024-11-08 23:13:37,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-08 23:13:37,353 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-08 23:13:37,353 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-08 23:13:37,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-08 23:13:37,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2024-11-08 23:13:37,362 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-08 23:13:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2024-11-08 23:13:37,363 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 98 [2024-11-08 23:13:37,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:37,363 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2024-11-08 23:13:37,363 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-08 23:13:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2024-11-08 23:13:37,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 23:13:37,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:37,364 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-08 23:13:37,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 23:13:37,364 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:37,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:37,365 INFO L85 PathProgramCache]: Analyzing trace with hash 937286957, now seen corresponding path program 1 times [2024-11-08 23:13:37,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:13:37,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578430984] [2024-11-08 23:13:37,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:37,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:13:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:13:37,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [157060888] [2024-11-08 23:13:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:37,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:13:37,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:13:37,402 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-08 23:13:37,407 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-08 23:13:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:37,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 23:13:37,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:13:38,483 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-08 23:13:38,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:13:38,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:13:38,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578430984] [2024-11-08 23:13:38,484 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:13:38,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157060888] [2024-11-08 23:13:38,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157060888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:38,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:38,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 23:13:38,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927906794] [2024-11-08 23:13:38,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:38,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 23:13:38,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:13:38,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 23:13:38,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-08 23:13:38,486 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-08 23:13:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:39,598 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2024-11-08 23:13:39,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 23:13:39,599 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-08 23:13:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:39,600 INFO L225 Difference]: With dead ends: 168 [2024-11-08 23:13:39,600 INFO L226 Difference]: Without dead ends: 166 [2024-11-08 23:13:39,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2024-11-08 23:13:39,601 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 134 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 23:13:39,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 342 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 23:13:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-08 23:13:39,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 122. [2024-11-08 23:13:39,609 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-08 23:13:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2024-11-08 23:13:39,610 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 99 [2024-11-08 23:13:39,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:39,611 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2024-11-08 23:13:39,611 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-08 23:13:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2024-11-08 23:13:39,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 23:13:39,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:39,612 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-08 23:13:39,633 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-08 23:13:39,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:13:39,817 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:39,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash -342576721, now seen corresponding path program 1 times [2024-11-08 23:13:39,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:13:39,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235816475] [2024-11-08 23:13:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:39,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:13:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:40,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:13:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:40,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:13:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:40,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:13:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:40,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:13:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:40,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:13:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:40,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:13:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:40,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:13:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:40,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:13:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:40,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:13:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:40,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:13:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:40,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:13:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:40,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:13:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:40,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:13:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:40,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:13:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:40,422 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-08 23:13:40,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:13:40,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235816475] [2024-11-08 23:13:40,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235816475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:40,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:40,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:13:40,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828585383] [2024-11-08 23:13:40,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:40,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:13:40,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:13:40,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:13:40,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:13:40,425 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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-08 23:13:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:40,666 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2024-11-08 23:13:40,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:13:40,666 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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-08 23:13:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:40,667 INFO L225 Difference]: With dead ends: 138 [2024-11-08 23:13:40,667 INFO L226 Difference]: Without dead ends: 136 [2024-11-08 23:13:40,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:13:40,668 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 51 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:13:40,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 507 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:13:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-08 23:13:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2024-11-08 23:13:40,676 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-08 23:13:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2024-11-08 23:13:40,677 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 99 [2024-11-08 23:13:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:40,678 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2024-11-08 23:13:40,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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-08 23:13:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2024-11-08 23:13:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 23:13:40,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:40,679 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-08 23:13:40,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 23:13:40,679 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:40,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:40,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1653714623, now seen corresponding path program 1 times [2024-11-08 23:13:40,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:13:40,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280660432] [2024-11-08 23:13:40,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:40,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:13:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:13:40,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682063923] [2024-11-08 23:13:40,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:40,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:13:40,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:13:40,701 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-08 23:13:40,708 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-08 23:13:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:13:40,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:13:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:13:40,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:13:40,842 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:13:40,842 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:13:40,857 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-08 23:13:41,047 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,SelfDestructingSolverStorable12 [2024-11-08 23:13:41,051 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:13:41,100 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:13:41,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:13:41 BoogieIcfgContainer [2024-11-08 23:13:41,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:13:41,103 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:13:41,103 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:13:41,104 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:13:41,104 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:13:28" (3/4) ... [2024-11-08 23:13:41,106 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:13:41,107 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:13:41,107 INFO L158 Benchmark]: Toolchain (without parser) took 13226.82ms. Allocated memory was 151.0MB in the beginning and 385.9MB in the end (delta: 234.9MB). Free memory was 78.6MB in the beginning and 131.7MB in the end (delta: -53.1MB). Peak memory consumption was 183.4MB. Max. memory is 16.1GB. [2024-11-08 23:13:41,107 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:13:41,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.23ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 78.5MB in the beginning and 177.7MB in the end (delta: -99.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:13:41,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.79ms. Allocated memory is still 209.7MB. Free memory was 177.7MB in the beginning and 175.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:13:41,108 INFO L158 Benchmark]: Boogie Preprocessor took 52.05ms. Allocated memory is still 209.7MB. Free memory was 174.6MB in the beginning and 172.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:13:41,108 INFO L158 Benchmark]: RCFGBuilder took 381.11ms. Allocated memory is still 209.7MB. Free memory was 172.5MB in the beginning and 155.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:13:41,108 INFO L158 Benchmark]: TraceAbstraction took 12454.99ms. Allocated memory was 209.7MB in the beginning and 385.9MB in the end (delta: 176.2MB). Free memory was 154.7MB in the beginning and 131.7MB in the end (delta: 23.0MB). Peak memory consumption was 198.1MB. Max. memory is 16.1GB. [2024-11-08 23:13:41,109 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 385.9MB. Free memory is still 131.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:13:41,110 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 151.0MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.23ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 78.5MB in the beginning and 177.7MB in the end (delta: -99.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.79ms. Allocated memory is still 209.7MB. Free memory was 177.7MB in the beginning and 175.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.05ms. Allocated memory is still 209.7MB. Free memory was 174.6MB in the beginning and 172.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 381.11ms. Allocated memory is still 209.7MB. Free memory was 172.5MB in the beginning and 155.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12454.99ms. Allocated memory was 209.7MB in the beginning and 385.9MB in the end (delta: 176.2MB). Free memory was 154.7MB in the beginning and 131.7MB in the end (delta: 23.0MB). Peak memory consumption was 198.1MB. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 385.9MB. Free memory is still 131.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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.3s, OverallIterations: 13, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 861 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 801 mSDsluCounter, 3471 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2595 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2894 IncrementalHoareTripleChecker+Invalid, 2977 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 876 mSDtfsCounter, 2894 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 714 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 2.8s 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.4s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1754 NumberOfCodeBlocks, 1754 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1152 ConstructedInterpolants, 2 QuantifiedInterpolants, 4319 SizeOfPredicates, 40 NumberOfNonLiveVariables, 924 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 4368/4368 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-08 23:13:41,161 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-?-c7c6ca5-m [2024-11-08 23:13:43,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:13:43,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:13:43,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:13:43,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:13:43,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:13:43,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:13:43,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:13:43,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:13:43,277 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:13:43,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:13:43,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:13:43,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:13:43,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:13:43,279 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:13:43,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:13:43,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:13:43,279 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:13:43,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:13:43,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:13:43,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:13:43,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:13:43,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:13:43,281 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:13:43,281 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:13:43,281 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:13:43,281 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:13:43,282 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:13:43,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:13:43,282 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:13:43,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:13:43,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:13:43,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:13:43,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:13:43,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:13:43,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:13:43,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:13:43,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:13:43,287 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:13:43,287 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:13:43,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:13:43,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:13:43,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:13:43,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:13:43,296 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-08 23:13:43,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:13:43,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:13:43,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:13:43,567 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:13:43,568 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:13:43,569 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-08 23:13:44,949 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:13:45,137 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:13:45,138 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-08 23:13:45,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218bd0805/d26bd4ffac414602a802d750264ab1ab/FLAGb372453e0 [2024-11-08 23:13:45,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218bd0805/d26bd4ffac414602a802d750264ab1ab [2024-11-08 23:13:45,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:13:45,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:13:45,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:13:45,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:13:45,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:13:45,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:13:45" (1/1) ... [2024-11-08 23:13:45,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3856f835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:45, skipping insertion in model container [2024-11-08 23:13:45,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:13:45" (1/1) ... [2024-11-08 23:13:45,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:13:45,678 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-08 23:13:45,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:13:45,730 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:13:45,743 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-08 23:13:45,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:13:45,782 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:13:45,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:45 WrapperNode [2024-11-08 23:13:45,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:13:45,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:13:45,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:13:45,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:13:45,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:45" (1/1) ... [2024-11-08 23:13:45,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:45" (1/1) ... [2024-11-08 23:13:45,823 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-11-08 23:13:45,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:13:45,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:13:45,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:13:45,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:13:45,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:45" (1/1) ... [2024-11-08 23:13:45,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:45" (1/1) ... [2024-11-08 23:13:45,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:45" (1/1) ... [2024-11-08 23:13:45,848 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-08 23:13:45,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:45" (1/1) ... [2024-11-08 23:13:45,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:45" (1/1) ... [2024-11-08 23:13:45,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:45" (1/1) ... [2024-11-08 23:13:45,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:45" (1/1) ... [2024-11-08 23:13:45,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:45" (1/1) ... [2024-11-08 23:13:45,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:45" (1/1) ... [2024-11-08 23:13:45,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:13:45,885 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:13:45,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:13:45,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:13:45,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:45" (1/1) ... [2024-11-08 23:13:45,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:13:45,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:13:45,925 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-08 23:13:45,929 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-08 23:13:45,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:13:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:13:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:13:45,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:13:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:13:45,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:13:46,043 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:13:46,045 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:13:46,248 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 23:13:46,249 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:13:46,263 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:13:46,263 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:13:46,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:13:46 BoogieIcfgContainer [2024-11-08 23:13:46,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:13:46,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:13:46,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:13:46,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:13:46,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:13:45" (1/3) ... [2024-11-08 23:13:46,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57889657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:13:46, skipping insertion in model container [2024-11-08 23:13:46,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:13:45" (2/3) ... [2024-11-08 23:13:46,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57889657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:13:46, skipping insertion in model container [2024-11-08 23:13:46,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:13:46" (3/3) ... [2024-11-08 23:13:46,273 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-08 23:13:46,287 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:13:46,288 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:13:46,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:13:46,357 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;@5f64eba4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:13:46,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:13:46,362 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-08 23:13:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 23:13:46,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:46,371 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-08 23:13:46,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:46,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash 416337941, now seen corresponding path program 1 times [2024-11-08 23:13:46,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:13:46,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037513798] [2024-11-08 23:13:46,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:46,390 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-08 23:13:46,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:13:46,393 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-08 23:13:46,394 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-08 23:13:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:46,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:13:46,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:13:46,558 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-08 23:13:46,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:13:46,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:13:46,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037513798] [2024-11-08 23:13:46,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037513798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:46,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:46,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:13:46,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898376031] [2024-11-08 23:13:46,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:46,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:13:46,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:13:46,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:13:46,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:13:46,583 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-08 23:13:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:46,602 INFO L93 Difference]: Finished difference Result 89 states and 148 transitions. [2024-11-08 23:13:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:13:46,604 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-08 23:13:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:46,610 INFO L225 Difference]: With dead ends: 89 [2024-11-08 23:13:46,610 INFO L226 Difference]: Without dead ends: 44 [2024-11-08 23:13:46,612 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-08 23:13:46,615 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-08 23:13:46,615 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-08 23:13:46,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-08 23:13:46,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-08 23:13:46,644 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-08 23:13:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2024-11-08 23:13:46,646 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 91 [2024-11-08 23:13:46,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:46,647 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2024-11-08 23:13:46,647 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-08 23:13:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2024-11-08 23:13:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 23:13:46,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:46,650 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-08 23:13:46,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:13:46,850 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-08 23:13:46,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:46,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:46,852 INFO L85 PathProgramCache]: Analyzing trace with hash 410614101, now seen corresponding path program 1 times [2024-11-08 23:13:46,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:13:46,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377924431] [2024-11-08 23:13:46,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:46,854 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-08 23:13:46,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:13:46,856 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-08 23:13:46,878 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-08 23:13:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:46,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:13:46,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:13:47,037 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-08 23:13:47,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:13:47,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:13:47,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377924431] [2024-11-08 23:13:47,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377924431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:13:47,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:13:47,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:13:47,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831944379] [2024-11-08 23:13:47,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:13:47,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:13:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:13:47,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:13:47,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:13:47,041 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-08 23:13:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:13:47,250 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2024-11-08 23:13:47,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:13:47,252 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-08 23:13:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:13:47,254 INFO L225 Difference]: With dead ends: 93 [2024-11-08 23:13:47,254 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 23:13:47,254 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-08 23:13:47,255 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-08 23:13:47,256 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-08 23:13:47,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 23:13:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2024-11-08 23:13:47,264 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-08 23:13:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-11-08 23:13:47,266 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 91 [2024-11-08 23:13:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:13:47,266 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-11-08 23:13:47,266 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-08 23:13:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-11-08 23:13:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-08 23:13:47,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:13:47,268 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-08 23:13:47,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 23:13:47,469 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-08 23:13:47,471 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:13:47,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:13:47,471 INFO L85 PathProgramCache]: Analyzing trace with hash -391425056, now seen corresponding path program 1 times [2024-11-08 23:13:47,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:13:47,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374534663] [2024-11-08 23:13:47,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:13:47,472 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-08 23:13:47,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:13:47,475 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-08 23:13:47,476 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-08 23:13:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:13:47,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 23:13:47,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:14:07,246 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-08 23:14:07,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:14:22,919 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-08 23:14:22,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:14:22,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374534663] [2024-11-08 23:14:22,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374534663] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 23:14:22,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:14:22,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2024-11-08 23:14:22,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449160583] [2024-11-08 23:14:22,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:14:22,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:14:22,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:14:22,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:14:22,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-11-08 23:14:22,922 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-08 23:14:24,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 23:14:30,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:14:30,042 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2024-11-08 23:14:30,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:14:30,045 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-08 23:14:30,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:14:30,048 INFO L225 Difference]: With dead ends: 61 [2024-11-08 23:14:30,048 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 23:14:30,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2024-11-08 23:14:30,050 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 19 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s 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.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:14:30,050 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.5s Time] [2024-11-08 23:14:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 23:14:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-11-08 23:14:30,069 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-08 23:14:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2024-11-08 23:14:30,072 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 92 [2024-11-08 23:14:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:14:30,072 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2024-11-08 23:14:30,073 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-08 23:14:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2024-11-08 23:14:30,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 23:14:30,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:14:30,078 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-08 23:14:30,082 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-08 23:14:30,279 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-08 23:14:30,280 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:14:30,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:14:30,281 INFO L85 PathProgramCache]: Analyzing trace with hash 78612323, now seen corresponding path program 1 times [2024-11-08 23:14:30,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:14:30,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814223098] [2024-11-08 23:14:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:14:30,281 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-08 23:14:30,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:14:30,284 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-08 23:14:30,285 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-08 23:14:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:14:30,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 23:14:30,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:14:40,511 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-08 23:14:40,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:14:50,228 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-08 23:14:50,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:14:50,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814223098] [2024-11-08 23:14:50,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814223098] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 23:14:50,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:14:50,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2024-11-08 23:14:50,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111200693] [2024-11-08 23:14:50,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:14:50,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:14:50,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:14:50,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:14:50,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-08 23:14:50,230 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)