./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.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 a710c8a85a9b8babc674eadb463f38727995c780b4aae16a0530660db602c87a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:43:28,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:43:28,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:43:28,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:43:28,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:43:28,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:43:28,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:43:28,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:43:28,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:43:28,236 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:43:28,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:43:28,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:43:28,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:43:28,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:43:28,238 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:43:28,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:43:28,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:43:28,239 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:43:28,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:43:28,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:43:28,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:43:28,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:43:28,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:43:28,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:43:28,242 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:43:28,242 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:43:28,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:43:28,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:43:28,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:43:28,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:43:28,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:43:28,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:43:28,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:43:28,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:43:28,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:43:28,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:43:28,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:43:28,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:43:28,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:43:28,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:43:28,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:43:28,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:43:28,252 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 -> a710c8a85a9b8babc674eadb463f38727995c780b4aae16a0530660db602c87a [2024-10-13 06:43:28,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:43:28,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:43:28,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:43:28,542 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:43:28,543 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:43:28,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.i [2024-10-13 06:43:30,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:43:30,308 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:43:30,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.i [2024-10-13 06:43:30,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bcf2b6b4/7f39b67ec45c41f4826575cfa8a90e24/FLAGb7a359b6b [2024-10-13 06:43:30,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bcf2b6b4/7f39b67ec45c41f4826575cfa8a90e24 [2024-10-13 06:43:30,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:43:30,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:43:30,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:43:30,676 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:43:30,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:43:30,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:43:30" (1/1) ... [2024-10-13 06:43:30,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d0c7bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:43:30, skipping insertion in model container [2024-10-13 06:43:30,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:43:30" (1/1) ... [2024-10-13 06:43:30,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:43:30,888 WARN L248 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_wrapper-sp_file-83.i[917,930] [2024-10-13 06:43:30,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:43:30,970 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:43:30,980 WARN L248 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_wrapper-sp_file-83.i[917,930] [2024-10-13 06:43:31,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:43:31,042 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:43:31,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:43:31 WrapperNode [2024-10-13 06:43:31,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:43:31,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:43:31,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:43:31,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:43:31,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:43:31" (1/1) ... [2024-10-13 06:43:31,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:43:31" (1/1) ... [2024-10-13 06:43:31,108 INFO L138 Inliner]: procedures = 29, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 522 [2024-10-13 06:43:31,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:43:31,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:43:31,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:43:31,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:43:31,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:43:31" (1/1) ... [2024-10-13 06:43:31,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:43:31" (1/1) ... [2024-10-13 06:43:31,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:43:31" (1/1) ... [2024-10-13 06:43:31,179 INFO L175 MemorySlicer]: Split 130 memory accesses to 2 slices as follows [2, 128]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-13 06:43:31,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:43:31" (1/1) ... [2024-10-13 06:43:31,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:43:31" (1/1) ... [2024-10-13 06:43:31,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:43:31" (1/1) ... [2024-10-13 06:43:31,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:43:31" (1/1) ... [2024-10-13 06:43:31,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:43:31" (1/1) ... [2024-10-13 06:43:31,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:43:31" (1/1) ... [2024-10-13 06:43:31,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:43:31,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:43:31,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:43:31,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:43:31,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:43:31" (1/1) ... [2024-10-13 06:43:31,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:43:31,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:43:31,277 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-10-13 06:43:31,280 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-10-13 06:43:31,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:43:31,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:43:31,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:43:31,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:43:31,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:43:31,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:43:31,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:43:31,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:43:31,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:43:31,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:43:31,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:43:31,334 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:43:31,334 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:43:31,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:43:31,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:43:31,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:43:31,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:43:31,490 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:43:31,494 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:43:32,070 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-10-13 06:43:32,071 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:43:32,117 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:43:32,117 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:43:32,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:43:32 BoogieIcfgContainer [2024-10-13 06:43:32,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:43:32,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:43:32,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:43:32,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:43:32,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:43:30" (1/3) ... [2024-10-13 06:43:32,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261b0b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:43:32, skipping insertion in model container [2024-10-13 06:43:32,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:43:31" (2/3) ... [2024-10-13 06:43:32,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261b0b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:43:32, skipping insertion in model container [2024-10-13 06:43:32,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:43:32" (3/3) ... [2024-10-13 06:43:32,127 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-83.i [2024-10-13 06:43:32,143 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:43:32,144 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:43:32,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:43:32,214 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;@399611a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:43:32,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:43:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 92 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:43:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:43:32,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:43:32,229 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:43:32,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:43:32,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:43:32,236 INFO L85 PathProgramCache]: Analyzing trace with hash -859057060, now seen corresponding path program 1 times [2024-10-13 06:43:32,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:43:32,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128418418] [2024-10-13 06:43:32,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:43:32,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:43:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:32,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:43:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:32,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:43:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:43:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:32,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:43:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:32,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:43:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:32,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:43:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:32,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:43:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:32,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:43:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:32,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:43:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:32,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:43:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:32,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:43:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:43:32,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:43:32,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128418418] [2024-10-13 06:43:32,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128418418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:43:32,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:43:32,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:43:32,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561512819] [2024-10-13 06:43:32,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:43:32,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:43:32,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:43:32,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:43:32,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:43:32,732 INFO L87 Difference]: Start difference. First operand has 105 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 92 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:43:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:43:32,799 INFO L93 Difference]: Finished difference Result 207 states and 327 transitions. [2024-10-13 06:43:32,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:43:32,802 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-13 06:43:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:43:32,811 INFO L225 Difference]: With dead ends: 207 [2024-10-13 06:43:32,811 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 06:43:32,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-10-13 06:43:32,818 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:43:32,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:43:32,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 06:43:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-13 06:43:32,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:43:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2024-10-13 06:43:32,869 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 101 [2024-10-13 06:43:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:43:32,869 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2024-10-13 06:43:32,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:43:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2024-10-13 06:43:32,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:43:32,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:43:32,875 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:43:32,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:43:32,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:43:32,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:43:32,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1754611118, now seen corresponding path program 1 times [2024-10-13 06:43:32,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:43:32,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109510050] [2024-10-13 06:43:32,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:43:32,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:43:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:43:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:43:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:43:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:43:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:43:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:43:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:43:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:43:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:43:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:43:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:43:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:43:33,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:43:33,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109510050] [2024-10-13 06:43:33,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109510050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:43:33,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:43:33,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:43:33,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191220560] [2024-10-13 06:43:33,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:43:33,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:43:33,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:43:33,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:43:33,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:43:33,224 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:43:33,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:43:33,298 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions. [2024-10-13 06:43:33,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:43:33,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-13 06:43:33,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:43:33,304 INFO L225 Difference]: With dead ends: 207 [2024-10-13 06:43:33,304 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 06:43:33,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:43:33,307 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:43:33,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 419 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:43:33,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 06:43:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-13 06:43:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:43:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2024-10-13 06:43:33,326 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 101 [2024-10-13 06:43:33,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:43:33,328 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2024-10-13 06:43:33,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 06:43:33,328 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2024-10-13 06:43:33,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:43:33,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:43:33,333 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:43:33,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:43:33,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:43:33,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:43:33,334 INFO L85 PathProgramCache]: Analyzing trace with hash -184550928, now seen corresponding path program 1 times [2024-10-13 06:43:33,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:43:33,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182073468] [2024-10-13 06:43:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:43:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:43:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:43:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:43:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:43:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:43:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:43:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:43:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:43:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:43:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:43:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:43:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:43:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,659 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:43:33,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:43:33,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182073468] [2024-10-13 06:43:33,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182073468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:43:33,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:43:33,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:43:33,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577879358] [2024-10-13 06:43:33,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:43:33,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:43:33,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:43:33,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:43:33,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:43:33,662 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:33,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:43:33,708 INFO L93 Difference]: Finished difference Result 212 states and 303 transitions. [2024-10-13 06:43:33,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:43:33,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-13 06:43:33,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:43:33,710 INFO L225 Difference]: With dead ends: 212 [2024-10-13 06:43:33,710 INFO L226 Difference]: Without dead ends: 108 [2024-10-13 06:43:33,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:43:33,713 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:43:33,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 416 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:43:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-13 06:43:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-13 06:43:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:43:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-10-13 06:43:33,727 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 101 [2024-10-13 06:43:33,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:43:33,727 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-10-13 06:43:33,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-10-13 06:43:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:43:33,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:43:33,732 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:43:33,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:43:33,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:43:33,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:43:33,732 INFO L85 PathProgramCache]: Analyzing trace with hash -993897554, now seen corresponding path program 1 times [2024-10-13 06:43:33,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:43:33,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29107681] [2024-10-13 06:43:33,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:43:33,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:43:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:43:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:43:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:43:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:43:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:43:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:43:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:43:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:43:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:43:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:43:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:43:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:43:33,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:43:33,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29107681] [2024-10-13 06:43:33,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29107681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:43:33,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:43:33,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:43:33,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695620620] [2024-10-13 06:43:33,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:43:33,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:43:33,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:43:33,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:43:33,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:43:33,927 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:43:33,975 INFO L93 Difference]: Finished difference Result 216 states and 307 transitions. [2024-10-13 06:43:33,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:43:33,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-13 06:43:33,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:43:33,977 INFO L225 Difference]: With dead ends: 216 [2024-10-13 06:43:33,981 INFO L226 Difference]: Without dead ends: 110 [2024-10-13 06:43:33,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:43:33,983 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 417 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-10-13 06:43:33,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 417 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:43:33,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-13 06:43:33,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-10-13 06:43:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:43:33,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-10-13 06:43:33,998 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 101 [2024-10-13 06:43:33,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:43:33,999 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-10-13 06:43:33,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-10-13 06:43:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:43:34,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:43:34,004 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:43:34,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:43:34,004 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:43:34,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:43:34,005 INFO L85 PathProgramCache]: Analyzing trace with hash -936639252, now seen corresponding path program 1 times [2024-10-13 06:43:34,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:43:34,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695884511] [2024-10-13 06:43:34,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:43:34,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:43:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:34,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:43:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:34,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:43:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:34,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:43:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:34,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:43:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:34,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:43:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:34,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:43:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:34,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:43:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:34,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:43:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:34,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:43:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:34,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:43:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:34,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:43:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:43:34,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:43:34,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695884511] [2024-10-13 06:43:34,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695884511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:43:34,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:43:34,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:43:34,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937717366] [2024-10-13 06:43:34,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:43:34,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:43:34,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:43:34,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:43:34,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:43:34,197 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:34,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:43:34,240 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2024-10-13 06:43:34,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:43:34,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-13 06:43:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:43:34,243 INFO L225 Difference]: With dead ends: 220 [2024-10-13 06:43:34,244 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 06:43:34,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:43:34,246 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:43:34,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 420 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:43:34,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 06:43:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-13 06:43:34,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:43:34,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2024-10-13 06:43:34,261 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 101 [2024-10-13 06:43:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:43:34,262 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2024-10-13 06:43:34,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2024-10-13 06:43:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:43:34,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:43:34,264 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:43:34,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:43:34,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:43:34,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:43:34,266 INFO L85 PathProgramCache]: Analyzing trace with hash -936579670, now seen corresponding path program 1 times [2024-10-13 06:43:34,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:43:34,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323561449] [2024-10-13 06:43:34,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:43:34,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:43:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:43:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:43:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:43:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:43:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:43:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:43:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:43:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:43:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:43:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:43:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:43:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:43:35,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:43:35,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323561449] [2024-10-13 06:43:35,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323561449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:43:35,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:43:35,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:43:35,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347075681] [2024-10-13 06:43:35,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:43:35,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:43:35,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:43:35,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:43:35,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:43:35,112 INFO L87 Difference]: Start difference. First operand 111 states and 156 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:43:35,351 INFO L93 Difference]: Finished difference Result 221 states and 311 transitions. [2024-10-13 06:43:35,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:43:35,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-13 06:43:35,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:43:35,353 INFO L225 Difference]: With dead ends: 221 [2024-10-13 06:43:35,353 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 06:43:35,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:43:35,355 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 163 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:43:35,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 279 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:43:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 06:43:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-13 06:43:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:43:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2024-10-13 06:43:35,371 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 155 transitions. Word has length 101 [2024-10-13 06:43:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:43:35,376 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 155 transitions. [2024-10-13 06:43:35,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:35,376 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2024-10-13 06:43:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 06:43:35,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:43:35,379 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:43:35,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:43:35,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:43:35,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:43:35,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2061795194, now seen corresponding path program 1 times [2024-10-13 06:43:35,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:43:35,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823263854] [2024-10-13 06:43:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:43:35,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:43:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:43:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:43:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:43:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:43:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:43:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:43:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:43:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:43:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:43:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:43:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:43:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:43:35,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:43:35,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823263854] [2024-10-13 06:43:35,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823263854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:43:35,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:43:35,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:43:35,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368104812] [2024-10-13 06:43:35,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:43:35,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:43:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:43:35,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:43:35,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:43:35,593 INFO L87 Difference]: Start difference. First operand 111 states and 155 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:43:35,728 INFO L93 Difference]: Finished difference Result 223 states and 312 transitions. [2024-10-13 06:43:35,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:43:35,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2024-10-13 06:43:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:43:35,730 INFO L225 Difference]: With dead ends: 223 [2024-10-13 06:43:35,730 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 06:43:35,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:43:35,731 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 3 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:43:35,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 454 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:43:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 06:43:35,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-13 06:43:35,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:43:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2024-10-13 06:43:35,744 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 102 [2024-10-13 06:43:35,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:43:35,744 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2024-10-13 06:43:35,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2024-10-13 06:43:35,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:43:35,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:43:35,746 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:43:35,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:43:35,746 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:43:35,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:43:35,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2060604880, now seen corresponding path program 1 times [2024-10-13 06:43:35,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:43:35,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992539972] [2024-10-13 06:43:35,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:43:35,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:43:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:36,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:43:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:36,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:43:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:36,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:43:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:36,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:43:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:36,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:43:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:36,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:43:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:36,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:43:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:36,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:43:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:36,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:43:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:36,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:43:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:36,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:43:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:43:36,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:43:36,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992539972] [2024-10-13 06:43:36,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992539972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:43:36,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:43:36,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:43:36,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913279313] [2024-10-13 06:43:36,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:43:36,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:43:36,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:43:36,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:43:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:43:36,950 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:43:37,405 INFO L93 Difference]: Finished difference Result 292 states and 405 transitions. [2024-10-13 06:43:37,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:43:37,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-13 06:43:37,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:43:37,407 INFO L225 Difference]: With dead ends: 292 [2024-10-13 06:43:37,407 INFO L226 Difference]: Without dead ends: 180 [2024-10-13 06:43:37,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:43:37,408 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 257 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:43:37,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 561 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:43:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-13 06:43:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2024-10-13 06:43:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 121 states have internal predecessors, (165), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:43:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2024-10-13 06:43:37,420 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 103 [2024-10-13 06:43:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:43:37,421 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2024-10-13 06:43:37,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2024-10-13 06:43:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:43:37,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:43:37,422 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:43:37,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:43:37,423 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:43:37,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:43:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash 780741202, now seen corresponding path program 1 times [2024-10-13 06:43:37,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:43:37,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910376889] [2024-10-13 06:43:37,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:43:37,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:43:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:43:37,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1330304448] [2024-10-13 06:43:37,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:43:37,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:43:37,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:43:37,551 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-10-13 06:43:37,567 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-10-13 06:43:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:37,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 06:43:37,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:43:38,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:43:38,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 06:43:38,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 06:43:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:43:38,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:43:38,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:43:38,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910376889] [2024-10-13 06:43:38,524 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:43:38,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330304448] [2024-10-13 06:43:38,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330304448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:43:38,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:43:38,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:43:38,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564481120] [2024-10-13 06:43:38,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:43:38,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:43:38,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:43:38,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:43:38,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:43:38,528 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:43:38,807 INFO L93 Difference]: Finished difference Result 334 states and 467 transitions. [2024-10-13 06:43:38,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:43:38,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-13 06:43:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:43:38,810 INFO L225 Difference]: With dead ends: 334 [2024-10-13 06:43:38,810 INFO L226 Difference]: Without dead ends: 201 [2024-10-13 06:43:38,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:43:38,811 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 294 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:43:38,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 350 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:43:38,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-13 06:43:38,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 150. [2024-10-13 06:43:38,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 137 states have (on average 1.3795620437956204) internal successors, (189), 137 states have internal predecessors, (189), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 06:43:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 211 transitions. [2024-10-13 06:43:38,829 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 211 transitions. Word has length 103 [2024-10-13 06:43:38,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:43:38,830 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 211 transitions. [2024-10-13 06:43:38,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 211 transitions. [2024-10-13 06:43:38,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:43:38,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:43:38,832 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:43:38,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 06:43:39,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:43:39,033 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:43:39,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:43:39,033 INFO L85 PathProgramCache]: Analyzing trace with hash -240327152, now seen corresponding path program 1 times [2024-10-13 06:43:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:43:39,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177412539] [2024-10-13 06:43:39,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:43:39,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:43:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:43:39,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2089025399] [2024-10-13 06:43:39,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:43:39,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:43:39,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:43:39,163 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-10-13 06:43:39,165 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-10-13 06:43:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:39,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 06:43:39,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:43:39,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 06:43:40,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:43:40,330 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-10-13 06:43:40,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2024-10-13 06:43:40,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:43:40,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-13 06:43:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:43:40,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:43:40,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:43:40,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177412539] [2024-10-13 06:43:40,420 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 06:43:40,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089025399] [2024-10-13 06:43:40,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089025399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:43:40,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:43:40,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:43:40,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765400824] [2024-10-13 06:43:40,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:43:40,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:43:40,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:43:40,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:43:40,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:43:40,422 INFO L87 Difference]: Start difference. First operand 150 states and 211 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:44,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 06:43:45,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:43:45,186 INFO L93 Difference]: Finished difference Result 470 states and 664 transitions. [2024-10-13 06:43:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:43:45,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-13 06:43:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:43:45,189 INFO L225 Difference]: With dead ends: 470 [2024-10-13 06:43:45,189 INFO L226 Difference]: Without dead ends: 321 [2024-10-13 06:43:45,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:43:45,191 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 179 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:43:45,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 622 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 441 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-10-13 06:43:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-13 06:43:45,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 198. [2024-10-13 06:43:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 173 states have internal predecessors, (234), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 06:43:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 278 transitions. [2024-10-13 06:43:45,216 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 278 transitions. Word has length 103 [2024-10-13 06:43:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:43:45,217 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 278 transitions. [2024-10-13 06:43:45,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 278 transitions. [2024-10-13 06:43:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:43:45,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:43:45,219 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:43:45,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 06:43:45,419 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,SelfDestructingSolverStorable9 [2024-10-13 06:43:45,420 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:43:45,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:43:45,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1171126897, now seen corresponding path program 1 times [2024-10-13 06:43:45,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:43:45,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463018695] [2024-10-13 06:43:45,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:43:45,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:43:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:46,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:43:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:46,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:43:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:46,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:43:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:46,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:43:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:46,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:43:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:46,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:43:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:46,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:43:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:46,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:43:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:46,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:43:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:46,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:43:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:46,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:43:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:46,891 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:43:46,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:43:46,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463018695] [2024-10-13 06:43:46,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463018695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:43:46,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:43:46,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:43:46,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473391788] [2024-10-13 06:43:46,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:43:46,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:43:46,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:43:46,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:43:46,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:43:46,894 INFO L87 Difference]: Start difference. First operand 198 states and 278 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-13 06:43:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:43:47,553 INFO L93 Difference]: Finished difference Result 351 states and 491 transitions. [2024-10-13 06:43:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:43:47,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103 [2024-10-13 06:43:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:43:47,557 INFO L225 Difference]: With dead ends: 351 [2024-10-13 06:43:47,557 INFO L226 Difference]: Without dead ends: 202 [2024-10-13 06:43:47,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:43:47,559 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 219 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:43:47,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 287 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:43:47,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-13 06:43:47,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-10-13 06:43:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 176 states have (on average 1.3352272727272727) internal successors, (235), 176 states have internal predecessors, (235), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 06:43:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 279 transitions. [2024-10-13 06:43:47,590 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 279 transitions. Word has length 103 [2024-10-13 06:43:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:43:47,590 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 279 transitions. [2024-10-13 06:43:47,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-13 06:43:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 279 transitions. [2024-10-13 06:43:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:43:47,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:43:47,593 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:43:47,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:43:47,594 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:43:47,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:43:47,594 INFO L85 PathProgramCache]: Analyzing trace with hash -749800242, now seen corresponding path program 1 times [2024-10-13 06:43:47,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:43:47,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386568077] [2024-10-13 06:43:47,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:43:47,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:43:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:48,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:43:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:48,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:43:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:48,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:43:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:48,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:43:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:48,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:43:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:48,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:43:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:48,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:43:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:48,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:43:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:48,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:43:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:48,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:43:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:48,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:43:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:43:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:43:48,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:43:48,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386568077] [2024-10-13 06:43:48,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386568077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:43:48,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:43:48,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:43:48,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931440404] [2024-10-13 06:43:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:43:48,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:43:48,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:43:48,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:43:48,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:43:48,905 INFO L87 Difference]: Start difference. First operand 202 states and 279 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:43:49,838 INFO L93 Difference]: Finished difference Result 455 states and 628 transitions. [2024-10-13 06:43:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:43:49,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-13 06:43:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:43:49,841 INFO L225 Difference]: With dead ends: 455 [2024-10-13 06:43:49,842 INFO L226 Difference]: Without dead ends: 302 [2024-10-13 06:43:49,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:43:49,843 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 324 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:43:49,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 614 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:43:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-13 06:43:49,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 229. [2024-10-13 06:43:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 203 states have (on average 1.3497536945812807) internal successors, (274), 203 states have internal predecessors, (274), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 06:43:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 318 transitions. [2024-10-13 06:43:49,868 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 318 transitions. Word has length 103 [2024-10-13 06:43:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:43:49,869 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 318 transitions. [2024-10-13 06:43:49,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 06:43:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 318 transitions. [2024-10-13 06:43:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:43:49,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:43:49,872 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:43:49,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:43:49,872 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:43:49,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:43:49,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1841675826, now seen corresponding path program 1 times [2024-10-13 06:43:49,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:43:49,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382269364] [2024-10-13 06:43:49,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:43:49,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:43:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat