./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.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_variablewrapping_normal_file-70.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 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:23:21,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:23:22,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:23:22,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:23:22,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:23:22,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:23:22,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:23:22,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:23:22,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:23:22,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:23:22,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:23:22,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:23:22,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:23:22,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:23:22,115 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:23:22,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:23:22,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:23:22,120 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:23:22,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:23:22,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:23:22,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:23:22,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:23:22,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:23:22,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:23:22,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:23:22,125 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:23:22,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:23:22,125 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:23:22,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:23:22,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:23:22,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:23:22,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:23:22,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:23:22,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:23:22,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:23:22,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:23:22,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:23:22,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:23:22,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:23:22,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:23:22,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:23:22,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:23:22,131 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 -> 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd [2024-11-09 01:23:22,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:23:22,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:23:22,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:23:22,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:23:22,441 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:23:22,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2024-11-09 01:23:23,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:23:24,146 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:23:24,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2024-11-09 01:23:24,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6871a0687/1ef8cf85f0294bf2a6eca4ab15dd2fcd/FLAG16aa7a8ba [2024-11-09 01:23:24,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6871a0687/1ef8cf85f0294bf2a6eca4ab15dd2fcd [2024-11-09 01:23:24,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:23:24,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:23:24,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:23:24,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:23:24,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:23:24,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:23:24" (1/1) ... [2024-11-09 01:23:24,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a028b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:24, skipping insertion in model container [2024-11-09 01:23:24,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:23:24" (1/1) ... [2024-11-09 01:23:24,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:23:24,385 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_variablewrapping_normal_file-70.i[913,926] [2024-11-09 01:23:24,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:23:24,444 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:23:24,455 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_variablewrapping_normal_file-70.i[913,926] [2024-11-09 01:23:24,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:23:24,501 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:23:24,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:24 WrapperNode [2024-11-09 01:23:24,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:23:24,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:23:24,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:23:24,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:23:24,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:24" (1/1) ... [2024-11-09 01:23:24,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:24" (1/1) ... [2024-11-09 01:23:24,587 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-09 01:23:24,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:23:24,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:23:24,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:23:24,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:23:24,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:24" (1/1) ... [2024-11-09 01:23:24,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:24" (1/1) ... [2024-11-09 01:23:24,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:24" (1/1) ... [2024-11-09 01:23:24,638 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-09 01:23:24,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:24" (1/1) ... [2024-11-09 01:23:24,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:24" (1/1) ... [2024-11-09 01:23:24,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:24" (1/1) ... [2024-11-09 01:23:24,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:24" (1/1) ... [2024-11-09 01:23:24,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:24" (1/1) ... [2024-11-09 01:23:24,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:24" (1/1) ... [2024-11-09 01:23:24,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:23:24,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:23:24,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:23:24,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:23:24,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:24" (1/1) ... [2024-11-09 01:23:24,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:23:24,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:23:24,713 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-09 01:23:24,719 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-09 01:23:24,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:23:24,772 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:23:24,772 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:23:24,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:23:24,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:23:24,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:23:24,856 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:23:24,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:23:25,171 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-09 01:23:25,172 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:23:25,187 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:23:25,187 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:23:25,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:23:25 BoogieIcfgContainer [2024-11-09 01:23:25,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:23:25,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:23:25,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:23:25,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:23:25,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:23:24" (1/3) ... [2024-11-09 01:23:25,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582e91e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:23:25, skipping insertion in model container [2024-11-09 01:23:25,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:24" (2/3) ... [2024-11-09 01:23:25,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582e91e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:23:25, skipping insertion in model container [2024-11-09 01:23:25,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:23:25" (3/3) ... [2024-11-09 01:23:25,195 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-70.i [2024-11-09 01:23:25,209 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:23:25,209 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:23:25,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:23:25,276 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;@5c8535ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:23:25,276 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:23:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:23:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 01:23:25,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:25,293 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:25,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:25,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:25,300 INFO L85 PathProgramCache]: Analyzing trace with hash 361599463, now seen corresponding path program 1 times [2024-11-09 01:23:25,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:23:25,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623535224] [2024-11-09 01:23:25,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:25,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:25,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:23:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:25,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:23:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:25,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:23:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:25,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:23:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:25,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:23:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:25,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:23:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:25,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:23:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:25,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:23:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:25,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 01:23:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:25,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:23:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:25,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:23:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:25,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:23:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:23:25,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:23:25,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623535224] [2024-11-09 01:23:25,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623535224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:25,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:25,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:23:25,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824086461] [2024-11-09 01:23:25,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:25,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:23:25,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:23:25,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:23:25,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:23:25,743 INFO L87 Difference]: Start difference. First operand has 60 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:23:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:25,775 INFO L93 Difference]: Finished difference Result 113 states and 176 transitions. [2024-11-09 01:23:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:23:25,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2024-11-09 01:23:25,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:25,786 INFO L225 Difference]: With dead ends: 113 [2024-11-09 01:23:25,787 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 01:23:25,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-09 01:23:25,795 INFO L432 NwaCegarLoop]: 78 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, 78 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-09 01:23:25,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:23:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 01:23:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 01:23:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:23:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2024-11-09 01:23:25,835 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 87 [2024-11-09 01:23:25,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:25,835 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2024-11-09 01:23:25,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:23:25,836 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2024-11-09 01:23:25,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 01:23:25,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:25,839 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:25,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:23:25,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:25,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:25,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1722646049, now seen corresponding path program 1 times [2024-11-09 01:23:25,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:23:25,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706294189] [2024-11-09 01:23:25,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:25,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:23:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:23:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:23:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:23:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:23:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:23:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:23:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:23:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 01:23:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:23:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:23:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:23:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:23:26,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:23:26,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706294189] [2024-11-09 01:23:26,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706294189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:26,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:26,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:23:26,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778197701] [2024-11-09 01:23:26,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:26,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:23:26,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:23:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:23:26,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:26,139 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:26,216 INFO L93 Difference]: Finished difference Result 109 states and 153 transitions. [2024-11-09 01:23:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:23:26,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-11-09 01:23:26,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:26,221 INFO L225 Difference]: With dead ends: 109 [2024-11-09 01:23:26,221 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 01:23:26,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-09 01:23:26,227 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:26,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:23:26,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 01:23:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 01:23:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:23:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2024-11-09 01:23:26,241 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 87 [2024-11-09 01:23:26,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:26,249 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2024-11-09 01:23:26,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2024-11-09 01:23:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 01:23:26,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:26,251 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:26,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:23:26,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:26,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:26,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1093098808, now seen corresponding path program 1 times [2024-11-09 01:23:26,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:23:26,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111175318] [2024-11-09 01:23:26,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:26,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:23:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:23:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:23:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:23:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:23:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:23:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:23:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:23:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 01:23:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:23:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:23:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:23:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:26,583 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:23:26,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:23:26,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111175318] [2024-11-09 01:23:26,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111175318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:26,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:26,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:23:26,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809069185] [2024-11-09 01:23:26,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:26,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:23:26,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:23:26,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:23:26,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:26,587 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:26,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:26,670 INFO L93 Difference]: Finished difference Result 109 states and 151 transitions. [2024-11-09 01:23:26,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:23:26,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-11-09 01:23:26,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:26,675 INFO L225 Difference]: With dead ends: 109 [2024-11-09 01:23:26,675 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 01:23:26,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-09 01:23:26,677 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:26,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:23:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 01:23:26,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 01:23:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:23:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2024-11-09 01:23:26,692 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 89 [2024-11-09 01:23:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:26,693 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-11-09 01:23:26,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-11-09 01:23:26,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 01:23:26,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:26,695 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:26,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:23:26,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:26,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:26,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1426861126, now seen corresponding path program 1 times [2024-11-09 01:23:26,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:23:26,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650593737] [2024-11-09 01:23:26,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:26,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:27,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:23:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:23:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:27,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:23:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:27,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:23:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:23:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:27,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:23:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:23:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:27,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:23:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:27,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 01:23:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:27,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:23:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:27,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:23:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:27,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:23:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:23:27,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:23:27,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650593737] [2024-11-09 01:23:27,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650593737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:27,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:27,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:23:27,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926848407] [2024-11-09 01:23:27,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:27,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:23:27,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:23:27,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:23:27,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:23:27,455 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:28,167 INFO L93 Difference]: Finished difference Result 202 states and 272 transitions. [2024-11-09 01:23:28,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:23:28,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-11-09 01:23:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:28,170 INFO L225 Difference]: With dead ends: 202 [2024-11-09 01:23:28,170 INFO L226 Difference]: Without dead ends: 149 [2024-11-09 01:23:28,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-09 01:23:28,177 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 162 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:28,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 409 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:23:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-09 01:23:28,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 90. [2024-11-09 01:23:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 74 states have internal predecessors, (92), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:23:28,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 120 transitions. [2024-11-09 01:23:28,202 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 120 transitions. Word has length 89 [2024-11-09 01:23:28,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:28,203 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 120 transitions. [2024-11-09 01:23:28,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:28,203 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2024-11-09 01:23:28,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 01:23:28,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:28,208 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:28,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:23:28,208 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:28,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:28,209 INFO L85 PathProgramCache]: Analyzing trace with hash -746802756, now seen corresponding path program 1 times [2024-11-09 01:23:28,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:23:28,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428792413] [2024-11-09 01:23:28,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:28,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:29,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:23:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:29,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:23:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:29,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:23:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:29,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:23:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:29,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:23:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:29,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:23:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:29,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:23:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:29,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:23:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:29,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 01:23:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:29,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:23:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:29,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:23:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:29,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:23:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:23:29,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:23:29,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428792413] [2024-11-09 01:23:29,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428792413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:29,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:29,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:23:29,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713773205] [2024-11-09 01:23:29,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:29,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:23:29,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:23:29,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:23:29,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:23:29,380 INFO L87 Difference]: Start difference. First operand 90 states and 120 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:29,611 INFO L93 Difference]: Finished difference Result 206 states and 272 transitions. [2024-11-09 01:23:29,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:23:29,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-11-09 01:23:29,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:29,620 INFO L225 Difference]: With dead ends: 206 [2024-11-09 01:23:29,620 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 01:23:29,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:23:29,622 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 74 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:29,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 167 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:23:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 01:23:29,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2024-11-09 01:23:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 74 states have internal predecessors, (91), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:23:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2024-11-09 01:23:29,647 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 89 [2024-11-09 01:23:29,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:29,648 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2024-11-09 01:23:29,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2024-11-09 01:23:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 01:23:29,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:29,650 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:29,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:23:29,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:29,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:29,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1588242492, now seen corresponding path program 1 times [2024-11-09 01:23:29,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:23:29,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685049248] [2024-11-09 01:23:29,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:29,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:31,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:23:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:31,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:23:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:31,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:23:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:31,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:23:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:31,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:23:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:31,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:23:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:31,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:23:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:31,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:23:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:31,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 01:23:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:31,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:23:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:31,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:23:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:31,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:23:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:23:31,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:23:31,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685049248] [2024-11-09 01:23:31,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685049248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:31,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:31,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:23:31,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731238258] [2024-11-09 01:23:31,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:31,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:23:31,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:23:31,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:23:31,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:23:31,942 INFO L87 Difference]: Start difference. First operand 90 states and 119 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:32,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:32,785 INFO L93 Difference]: Finished difference Result 232 states and 303 transitions. [2024-11-09 01:23:32,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:23:32,786 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-11-09 01:23:32,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:32,788 INFO L225 Difference]: With dead ends: 232 [2024-11-09 01:23:32,788 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 01:23:32,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:23:32,790 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 117 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:32,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 416 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:23:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 01:23:32,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 101. [2024-11-09 01:23:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.25) internal successors, (105), 85 states have internal predecessors, (105), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:23:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 133 transitions. [2024-11-09 01:23:32,813 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 133 transitions. Word has length 89 [2024-11-09 01:23:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:32,813 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 133 transitions. [2024-11-09 01:23:32,813 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 133 transitions. [2024-11-09 01:23:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 01:23:32,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:32,815 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:32,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:23:32,816 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:32,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2026666434, now seen corresponding path program 1 times [2024-11-09 01:23:32,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:23:32,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28655224] [2024-11-09 01:23:32,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:32,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:23:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:23:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:23:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:23:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:23:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:23:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:23:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:23:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 01:23:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:23:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:23:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:23:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:23:33,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:23:33,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28655224] [2024-11-09 01:23:33,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28655224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:33,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:33,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:23:33,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696444550] [2024-11-09 01:23:33,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:33,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:23:33,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:23:33,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:23:33,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:23:33,925 INFO L87 Difference]: Start difference. First operand 101 states and 133 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:34,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:34,148 INFO L93 Difference]: Finished difference Result 221 states and 290 transitions. [2024-11-09 01:23:34,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:23:34,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-11-09 01:23:34,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:34,150 INFO L225 Difference]: With dead ends: 221 [2024-11-09 01:23:34,152 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 01:23:34,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:23:34,153 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 24 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:34,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 241 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:23:34,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 01:23:34,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 102. [2024-11-09 01:23:34,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 86 states have internal predecessors, (106), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:23:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2024-11-09 01:23:34,169 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 89 [2024-11-09 01:23:34,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:34,170 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2024-11-09 01:23:34,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2024-11-09 01:23:34,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 01:23:34,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:34,171 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:34,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:23:34,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:34,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1847037816, now seen corresponding path program 1 times [2024-11-09 01:23:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:23:34,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635328130] [2024-11-09 01:23:34,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:34,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:23:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:23:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:23:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:23:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:23:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:23:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:23:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:23:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 01:23:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:23:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:23:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:23:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,242 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:23:34,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:23:34,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635328130] [2024-11-09 01:23:34,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635328130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:34,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:34,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:23:34,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210457275] [2024-11-09 01:23:34,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:34,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:23:34,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:23:34,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:23:34,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:34,247 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:34,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:34,265 INFO L93 Difference]: Finished difference Result 216 states and 283 transitions. [2024-11-09 01:23:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:23:34,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-11-09 01:23:34,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:34,268 INFO L225 Difference]: With dead ends: 216 [2024-11-09 01:23:34,268 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 01:23:34,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-09 01:23:34,270 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 36 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:34,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 165 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:23:34,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 01:23:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2024-11-09 01:23:34,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 86 states have internal predecessors, (105), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:23:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2024-11-09 01:23:34,285 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 89 [2024-11-09 01:23:34,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:34,285 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2024-11-09 01:23:34,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2024-11-09 01:23:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 01:23:34,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:34,286 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:34,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:23:34,287 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:34,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:34,290 INFO L85 PathProgramCache]: Analyzing trace with hash 567174138, now seen corresponding path program 1 times [2024-11-09 01:23:34,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:23:34,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348151034] [2024-11-09 01:23:34,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:34,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:23:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:23:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:23:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:23:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:23:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:23:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:23:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:23:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 01:23:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:23:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:23:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:23:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:23:34,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:23:34,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348151034] [2024-11-09 01:23:34,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348151034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:34,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:34,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:23:34,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247526714] [2024-11-09 01:23:34,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:34,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:23:34,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:23:34,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:23:34,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:23:34,449 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:34,483 INFO L93 Difference]: Finished difference Result 216 states and 281 transitions. [2024-11-09 01:23:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:23:34,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-11-09 01:23:34,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:34,487 INFO L225 Difference]: With dead ends: 216 [2024-11-09 01:23:34,487 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 01:23:34,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:23:34,488 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 26 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:34,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 265 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:23:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 01:23:34,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2024-11-09 01:23:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 74 states have internal predecessors, (89), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:23:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 117 transitions. [2024-11-09 01:23:34,500 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 117 transitions. Word has length 89 [2024-11-09 01:23:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:34,500 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 117 transitions. [2024-11-09 01:23:34,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:34,501 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2024-11-09 01:23:34,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 01:23:34,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:34,502 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:34,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:23:34,502 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:34,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:34,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1590435370, now seen corresponding path program 1 times [2024-11-09 01:23:34,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:23:34,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602992251] [2024-11-09 01:23:34,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:34,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:23:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:23:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:23:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:23:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:23:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:23:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:23:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:23:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 01:23:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:23:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:23:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:23:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:23:34,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:23:34,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602992251] [2024-11-09 01:23:34,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602992251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:34,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:34,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:23:34,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090538502] [2024-11-09 01:23:34,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:34,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:23:34,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:23:34,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:23:34,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:34,583 INFO L87 Difference]: Start difference. First operand 90 states and 117 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:34,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:34,621 INFO L93 Difference]: Finished difference Result 177 states and 231 transitions. [2024-11-09 01:23:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:23:34,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 92 [2024-11-09 01:23:34,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:34,624 INFO L225 Difference]: With dead ends: 177 [2024-11-09 01:23:34,625 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 01:23:34,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-09 01:23:34,625 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:34,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:23:34,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 01:23:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 01:23:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 74 states have internal predecessors, (87), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:23:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2024-11-09 01:23:34,637 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 92 [2024-11-09 01:23:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:34,637 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2024-11-09 01:23:34,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2024-11-09 01:23:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 01:23:34,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:34,639 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:34,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:23:34,639 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:34,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash 790629379, now seen corresponding path program 1 times [2024-11-09 01:23:34,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:23:34,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889307551] [2024-11-09 01:23:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:34,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:23:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:23:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:23:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:23:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:23:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:23:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:23:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:23:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 01:23:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:23:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:23:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:23:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 01:23:34,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:23:34,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889307551] [2024-11-09 01:23:34,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889307551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:23:34,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805730963] [2024-11-09 01:23:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:34,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:23:34,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:23:34,899 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-09 01:23:34,900 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-09 01:23:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:35,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 01:23:35,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:23:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-09 01:23:35,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:23:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 01:23:36,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805730963] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:23:36,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:23:36,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 14 [2024-11-09 01:23:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118305285] [2024-11-09 01:23:36,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:23:36,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 01:23:36,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:23:36,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 01:23:36,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:23:36,013 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-09 01:23:37,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:37,140 INFO L93 Difference]: Finished difference Result 258 states and 317 transitions. [2024-11-09 01:23:37,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 01:23:37,141 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 94 [2024-11-09 01:23:37,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:37,142 INFO L225 Difference]: With dead ends: 258 [2024-11-09 01:23:37,143 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 01:23:37,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2024-11-09 01:23:37,144 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 287 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:37,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 299 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:23:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 01:23:37,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 105. [2024-11-09 01:23:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.160919540229885) internal successors, (101), 88 states have internal predecessors, (101), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:23:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 129 transitions. [2024-11-09 01:23:37,153 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 129 transitions. Word has length 94 [2024-11-09 01:23:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:37,154 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 129 transitions. [2024-11-09 01:23:37,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-09 01:23:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2024-11-09 01:23:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 01:23:37,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:37,155 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:37,174 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-09 01:23:37,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 01:23:37,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:37,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:37,357 INFO L85 PathProgramCache]: Analyzing trace with hash 984098179, now seen corresponding path program 1 times [2024-11-09 01:23:37,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:23:37,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794832056] [2024-11-09 01:23:37,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:37,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:37,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:23:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:37,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:23:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:37,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:23:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:37,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:23:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:37,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:23:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:37,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:23:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:37,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:23:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:37,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:23:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:37,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 01:23:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:37,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:23:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:37,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:23:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:37,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:23:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 01:23:37,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:23:37,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794832056] [2024-11-09 01:23:37,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794832056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:23:37,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667672763] [2024-11-09 01:23:37,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:37,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:23:37,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:23:37,877 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-09 01:23:37,879 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-09 01:23:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:37,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 01:23:37,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:23:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-09 01:23:38,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:23:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 01:23:38,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667672763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:23:38,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:23:38,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 25 [2024-11-09 01:23:38,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776088394] [2024-11-09 01:23:38,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:23:38,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 01:23:38,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:23:38,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 01:23:38,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2024-11-09 01:23:38,699 INFO L87 Difference]: Start difference. First operand 105 states and 129 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2024-11-09 01:23:39,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:39,728 INFO L93 Difference]: Finished difference Result 230 states and 278 transitions. [2024-11-09 01:23:39,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 01:23:39,729 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) Word has length 94 [2024-11-09 01:23:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:39,730 INFO L225 Difference]: With dead ends: 230 [2024-11-09 01:23:39,730 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 01:23:39,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=328, Invalid=1312, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 01:23:39,732 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 262 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:39,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 368 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:23:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 01:23:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 111. [2024-11-09 01:23:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 93 states have internal predecessors, (103), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:23:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2024-11-09 01:23:39,747 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 94 [2024-11-09 01:23:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:39,747 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2024-11-09 01:23:39,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 25 states have internal predecessors, (79), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2024-11-09 01:23:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2024-11-09 01:23:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 01:23:39,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:39,749 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:39,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:23:39,952 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,SelfDestructingSolverStorable11 [2024-11-09 01:23:39,953 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:39,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:39,953 INFO L85 PathProgramCache]: Analyzing trace with hash -27019071, now seen corresponding path program 1 times [2024-11-09 01:23:39,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:23:39,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776700931] [2024-11-09 01:23:39,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:39,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:23:39,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:23:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:23:40,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:23:40,049 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:23:40,050 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:23:40,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:23:40,055 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:23:40,135 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:23:40,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:23:40 BoogieIcfgContainer [2024-11-09 01:23:40,138 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:23:40,139 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:23:40,139 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:23:40,139 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:23:40,139 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:23:25" (3/4) ... [2024-11-09 01:23:40,143 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:23:40,144 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:23:40,145 INFO L158 Benchmark]: Toolchain (without parser) took 15974.08ms. Allocated memory was 151.0MB in the beginning and 356.5MB in the end (delta: 205.5MB). Free memory was 96.1MB in the beginning and 139.4MB in the end (delta: -43.3MB). Peak memory consumption was 163.6MB. Max. memory is 16.1GB. [2024-11-09 01:23:40,145 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:23:40,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.07ms. Allocated memory is still 151.0MB. Free memory was 95.8MB in the beginning and 81.3MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 01:23:40,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.08ms. Allocated memory is still 151.0MB. Free memory was 81.0MB in the beginning and 78.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:23:40,146 INFO L158 Benchmark]: Boogie Preprocessor took 80.40ms. Allocated memory is still 151.0MB. Free memory was 78.0MB in the beginning and 74.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:23:40,146 INFO L158 Benchmark]: RCFGBuilder took 515.14ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 74.4MB in the beginning and 164.9MB in the end (delta: -90.5MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-09 01:23:40,147 INFO L158 Benchmark]: TraceAbstraction took 14948.62ms. Allocated memory was 203.4MB in the beginning and 356.5MB in the end (delta: 153.1MB). Free memory was 164.2MB in the beginning and 140.5MB in the end (delta: 23.8MB). Peak memory consumption was 176.8MB. Max. memory is 16.1GB. [2024-11-09 01:23:40,147 INFO L158 Benchmark]: Witness Printer took 5.71ms. Allocated memory is still 356.5MB. Free memory was 140.5MB in the beginning and 139.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:23:40,149 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.14ms. Allocated memory is still 151.0MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.07ms. Allocated memory is still 151.0MB. Free memory was 95.8MB in the beginning and 81.3MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.08ms. Allocated memory is still 151.0MB. Free memory was 81.0MB in the beginning and 78.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.40ms. Allocated memory is still 151.0MB. Free memory was 78.0MB in the beginning and 74.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 515.14ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 74.4MB in the beginning and 164.9MB in the end (delta: -90.5MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14948.62ms. Allocated memory was 203.4MB in the beginning and 356.5MB in the end (delta: 153.1MB). Free memory was 164.2MB in the beginning and 140.5MB in the end (delta: 23.8MB). Peak memory consumption was 176.8MB. Max. memory is 16.1GB. * Witness Printer took 5.71ms. Allocated memory is still 356.5MB. Free memory was 140.5MB in the beginning and 139.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryArithmeticDOUBLEoperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_4 = 19138; [L25] signed char var_1_6 = 25; [L26] signed long int var_1_7 = -50; [L27] double var_1_8 = 8.3; [L28] double var_1_9 = 255.6; [L29] double var_1_10 = 10000000.375; [L30] double var_1_11 = 0.0; [L31] double var_1_12 = 255.375; [L32] unsigned char var_1_13 = 50; [L33] unsigned char var_1_14 = 2; [L34] signed char var_1_15 = 1; [L35] signed char var_1_16 = 5; VAL [isInitial=0, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L89] isInitial = 1 [L90] FCALL initially() [L91] COND TRUE 1 [L92] FCALL updateLastVariables() [L93] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L64] var_1_4 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L65] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L67] var_1_9 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L68] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L69] var_1_10 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L70] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L72] RET assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L73] var_1_12 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L74] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L75] var_1_14 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L76] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L77] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L77] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L78] var_1_16 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L79] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L80] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L80] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L93] RET updateVariables() [L94] CALL step() [L39] var_1_13 = var_1_14 [L40] var_1_15 = var_1_16 VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L44] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L47] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] COND FALSE !(stepLocal_0 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) [L51] var_1_7 = (var_1_13 + (var_1_1 + var_1_4)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988, var_1_8=83/10] [L53] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, stepLocal_1=0, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988, var_1_8=83/10] [L54] COND FALSE !(var_1_13 < stepLocal_1) [L57] var_1_8 = ((var_1_11 - var_1_12) - var_1_9) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L94] RET step() [L95] CALL, EXPR property() [L85] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85-L86] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))) && ((var_1_13 < var_1_13) ? (var_1_8 == ((double) (var_1_9 - var_1_10))) : (var_1_8 == ((double) ((var_1_11 - var_1_12) - var_1_9))))) && (var_1_13 == ((unsigned char) var_1_14))) && (var_1_15 == ((signed char) var_1_16)) ; [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L19] reach_error() VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=126, var_1_16=126, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 13, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 992 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 988 mSDsluCounter, 2779 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1886 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2362 IncrementalHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 893 mSDtfsCounter, 2362 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 791 GetRequests, 685 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=12, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 272 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 1359 NumberOfCodeBlocks, 1359 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1437 ConstructedInterpolants, 0 QuantifiedInterpolants, 6018 SizeOfPredicates, 6 NumberOfNonLiveVariables, 455 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 4050/4224 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-09 01:23:40,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- 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_variablewrapping_normal_file-70.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 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:23:42,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:23:42,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:23:42,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:23:42,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:23:42,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:23:42,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:23:42,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:23:42,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:23:42,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:23:42,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:23:42,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:23:42,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:23:42,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:23:42,616 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:23:42,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:23:42,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:23:42,619 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:23:42,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:23:42,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:23:42,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:23:42,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:23:42,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:23:42,622 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:23:42,622 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:23:42,622 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:23:42,623 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:23:42,625 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:23:42,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:23:42,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:23:42,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:23:42,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:23:42,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:23:42,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:23:42,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:23:42,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:23:42,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:23:42,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:23:42,628 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:23:42,628 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:23:42,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:23:42,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:23:42,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:23:42,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:23:42,630 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 -> 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd [2024-11-09 01:23:42,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:23:42,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:23:42,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:23:42,980 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:23:42,980 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:23:42,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2024-11-09 01:23:44,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:23:44,876 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:23:44,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2024-11-09 01:23:44,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a126b1bf/e2d2a410c730435aa6538e1527cb145e/FLAG38e98c9fa [2024-11-09 01:23:45,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a126b1bf/e2d2a410c730435aa6538e1527cb145e [2024-11-09 01:23:45,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:23:45,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:23:45,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:23:45,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:23:45,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:23:45,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:23:45" (1/1) ... [2024-11-09 01:23:45,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1de999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:45, skipping insertion in model container [2024-11-09 01:23:45,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:23:45" (1/1) ... [2024-11-09 01:23:45,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:23:45,469 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_variablewrapping_normal_file-70.i[913,926] [2024-11-09 01:23:45,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:23:45,556 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:23:45,572 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_variablewrapping_normal_file-70.i[913,926] [2024-11-09 01:23:45,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:23:45,655 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:23:45,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:45 WrapperNode [2024-11-09 01:23:45,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:23:45,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:23:45,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:23:45,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:23:45,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:45" (1/1) ... [2024-11-09 01:23:45,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:45" (1/1) ... [2024-11-09 01:23:45,711 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-11-09 01:23:45,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:23:45,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:23:45,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:23:45,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:23:45,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:45" (1/1) ... [2024-11-09 01:23:45,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:45" (1/1) ... [2024-11-09 01:23:45,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:45" (1/1) ... [2024-11-09 01:23:45,755 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-09 01:23:45,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:45" (1/1) ... [2024-11-09 01:23:45,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:45" (1/1) ... [2024-11-09 01:23:45,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:45" (1/1) ... [2024-11-09 01:23:45,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:45" (1/1) ... [2024-11-09 01:23:45,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:45" (1/1) ... [2024-11-09 01:23:45,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:45" (1/1) ... [2024-11-09 01:23:45,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:23:45,789 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:23:45,789 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:23:45,789 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:23:45,790 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:45" (1/1) ... [2024-11-09 01:23:45,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:23:45,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:23:45,827 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-09 01:23:45,831 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-09 01:23:45,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:23:45,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:23:45,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:23:45,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:23:45,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:23:45,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:23:45,971 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:23:45,974 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:23:47,188 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 01:23:47,189 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:23:47,208 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:23:47,212 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:23:47,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:23:47 BoogieIcfgContainer [2024-11-09 01:23:47,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:23:47,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:23:47,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:23:47,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:23:47,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:23:45" (1/3) ... [2024-11-09 01:23:47,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81171f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:23:47, skipping insertion in model container [2024-11-09 01:23:47,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:45" (2/3) ... [2024-11-09 01:23:47,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81171f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:23:47, skipping insertion in model container [2024-11-09 01:23:47,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:23:47" (3/3) ... [2024-11-09 01:23:47,237 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-70.i [2024-11-09 01:23:47,251 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:23:47,252 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:23:47,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:23:47,325 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;@1c0fd077, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:23:47,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:23:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:23:47,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 01:23:47,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:47,345 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:47,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:47,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:47,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1062525254, now seen corresponding path program 1 times [2024-11-09 01:23:47,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:23:47,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501267489] [2024-11-09 01:23:47,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:47,369 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-09 01:23:47,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:23:47,373 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-09 01:23:47,374 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-09 01:23:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:47,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:23:47,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:23:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-09 01:23:47,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:23:47,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:23:47,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501267489] [2024-11-09 01:23:47,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501267489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:47,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:47,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:23:47,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525958656] [2024-11-09 01:23:47,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:47,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:23:47,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:23:47,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:23:47,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:23:47,812 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:23:47,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:47,843 INFO L93 Difference]: Finished difference Result 83 states and 132 transitions. [2024-11-09 01:23:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:23:47,845 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2024-11-09 01:23:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:47,854 INFO L225 Difference]: With dead ends: 83 [2024-11-09 01:23:47,854 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 01:23:47,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 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-09 01:23:47,880 INFO L432 NwaCegarLoop]: 56 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, 56 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-09 01:23:47,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:23:47,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 01:23:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 01:23:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:23:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2024-11-09 01:23:47,933 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 83 [2024-11-09 01:23:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:47,934 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2024-11-09 01:23:47,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 01:23:47,935 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2024-11-09 01:23:47,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 01:23:47,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:47,940 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:47,954 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-09 01:23:48,140 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-09 01:23:48,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:48,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash 960529726, now seen corresponding path program 1 times [2024-11-09 01:23:48,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:23:48,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502365872] [2024-11-09 01:23:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:48,144 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-09 01:23:48,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:23:48,148 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-09 01:23:48,149 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-09 01:23:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:48,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 01:23:48,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:23:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:23:48,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:23:48,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:23:48,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502365872] [2024-11-09 01:23:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502365872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:48,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:48,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:23:48,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105236855] [2024-11-09 01:23:48,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:48,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:23:48,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:23:48,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:23:48,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:48,535 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:49,782 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2024-11-09 01:23:49,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:23:49,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-11-09 01:23:49,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:49,800 INFO L225 Difference]: With dead ends: 79 [2024-11-09 01:23:49,800 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 01:23:49,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 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-09 01:23:49,802 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:49,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 01:23:49,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 01:23:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 01:23:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 01:23:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2024-11-09 01:23:49,815 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 83 [2024-11-09 01:23:49,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:49,816 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2024-11-09 01:23:49,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 01:23:49,817 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2024-11-09 01:23:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 01:23:49,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:49,821 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:49,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:23:50,022 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-09 01:23:50,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:50,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:50,025 INFO L85 PathProgramCache]: Analyzing trace with hash 962376768, now seen corresponding path program 1 times [2024-11-09 01:23:50,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:23:50,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214850865] [2024-11-09 01:23:50,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:50,026 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-09 01:23:50,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:23:50,029 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-09 01:23:50,030 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-09 01:23:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:50,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 01:23:50,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:23:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-09 01:23:51,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:23:51,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:23:51,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214850865] [2024-11-09 01:23:51,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214850865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:23:51,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [930912829] [2024-11-09 01:23:51,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:51,201 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 01:23:51,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 01:23:51,206 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 01:23:51,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-09 01:23:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:52,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:23:52,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:23:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-09 01:23:52,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:23:52,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [930912829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:23:52,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:23:52,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-09 01:23:52,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206560869] [2024-11-09 01:23:52,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:23:52,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:23:52,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:23:52,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:23:52,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:23:52,559 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 01:23:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:54,866 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2024-11-09 01:23:54,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:23:54,867 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 83 [2024-11-09 01:23:54,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:54,869 INFO L225 Difference]: With dead ends: 111 [2024-11-09 01:23:54,869 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 01:23:54,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:23:54,872 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 61 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:54,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 126 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 01:23:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 01:23:54,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2024-11-09 01:23:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.127659574468085) internal successors, (53), 48 states have internal predecessors, (53), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 01:23:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-11-09 01:23:54,895 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 83 [2024-11-09 01:23:54,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:54,898 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-11-09 01:23:54,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 01:23:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-11-09 01:23:54,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 01:23:54,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:54,900 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:23:54,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:23:55,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-09 01:23:55,301 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-09 01:23:55,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:23:55,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:55,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1642435138, now seen corresponding path program 1 times [2024-11-09 01:23:55,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:23:55,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962853212] [2024-11-09 01:23:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:55,309 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-09 01:23:55,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:23:55,312 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:23:55,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 01:23:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:55,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 01:23:55,620 INFO L278 TraceCheckSpWp]: Computing forward predicates...