./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.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 0a15bafc8303311b2bd7bb6d250a0c3e0c3fd8acbc6e1c59dc33f3d3e662f861 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:09:16,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:09:16,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:09:16,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:09:16,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:09:16,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:09:16,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:09:16,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:09:16,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:09:16,375 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:09:16,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:09:16,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:09:16,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:09:16,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:09:16,380 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:09:16,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:09:16,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:09:16,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:09:16,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:09:16,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:09:16,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:09:16,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:09:16,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:09:16,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:09:16,387 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:09:16,387 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:09:16,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:09:16,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:09:16,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:09:16,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:09:16,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:09:16,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:09:16,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:09:16,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:09:16,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:09:16,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:09:16,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:09:16,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:09:16,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:09:16,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:09:16,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:09:16,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:09:16,393 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 -> 0a15bafc8303311b2bd7bb6d250a0c3e0c3fd8acbc6e1c59dc33f3d3e662f861 [2024-11-12 07:09:16,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:09:16,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:09:16,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:09:16,697 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:09:16,698 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:09:16,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.i [2024-11-12 07:09:18,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:09:18,435 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:09:18,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.i [2024-11-12 07:09:18,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae8230573/555d67e1d1994fd992fea0818efee556/FLAG874f7b3a7 [2024-11-12 07:09:18,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae8230573/555d67e1d1994fd992fea0818efee556 [2024-11-12 07:09:18,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:09:18,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:09:18,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:09:18,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:09:18,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:09:18,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:09:18" (1/1) ... [2024-11-12 07:09:18,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39acff2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:18, skipping insertion in model container [2024-11-12 07:09:18,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:09:18" (1/1) ... [2024-11-12 07:09:18,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:09:19,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.i[916,929] [2024-11-12 07:09:19,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:09:19,077 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:09:19,087 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-40.i[916,929] [2024-11-12 07:09:19,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:09:19,149 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:09:19,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:19 WrapperNode [2024-11-12 07:09:19,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:09:19,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:09:19,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:09:19,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:09:19,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:19" (1/1) ... [2024-11-12 07:09:19,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:19" (1/1) ... [2024-11-12 07:09:19,228 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 475 [2024-11-12 07:09:19,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:09:19,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:09:19,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:09:19,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:09:19,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:19" (1/1) ... [2024-11-12 07:09:19,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:19" (1/1) ... [2024-11-12 07:09:19,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:19" (1/1) ... [2024-11-12 07:09:19,280 INFO L175 MemorySlicer]: Split 120 memory accesses to 8 slices as follows [2, 16, 14, 15, 27, 17, 10, 19]. 23 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 1, 3, 3, 2, 3]. The 17 writes are split as follows [0, 2, 2, 1, 3, 3, 2, 4]. [2024-11-12 07:09:19,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:19" (1/1) ... [2024-11-12 07:09:19,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:19" (1/1) ... [2024-11-12 07:09:19,300 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:19" (1/1) ... [2024-11-12 07:09:19,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:19" (1/1) ... [2024-11-12 07:09:19,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:19" (1/1) ... [2024-11-12 07:09:19,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:19" (1/1) ... [2024-11-12 07:09:19,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:09:19,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:09:19,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:09:19,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:09:19,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:19" (1/1) ... [2024-11-12 07:09:19,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:09:19,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:09:19,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:09:19,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:09:19,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:09:19,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-12 07:09:19,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-12 07:09:19,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-12 07:09:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-12 07:09:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-12 07:09:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-12 07:09:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-12 07:09:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-12 07:09:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:09:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:09:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 07:09:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 07:09:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 07:09:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 07:09:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-12 07:09:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-12 07:09:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-12 07:09:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-12 07:09:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-12 07:09:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-12 07:09:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-12 07:09:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-12 07:09:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-12 07:09:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-12 07:09:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:09:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:09:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 07:09:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 07:09:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 07:09:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 07:09:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-12 07:09:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-12 07:09:19,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-12 07:09:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-12 07:09:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-12 07:09:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-12 07:09:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-12 07:09:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-12 07:09:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-12 07:09:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-12 07:09:19,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:09:19,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:09:19,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:09:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:09:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 07:09:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 07:09:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 07:09:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 07:09:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-12 07:09:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-12 07:09:19,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:09:19,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:09:19,593 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:09:19,595 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:09:20,150 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-12 07:09:20,151 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:09:20,171 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:09:20,171 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:09:20,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:09:20 BoogieIcfgContainer [2024-11-12 07:09:20,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:09:20,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:09:20,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:09:20,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:09:20,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:09:18" (1/3) ... [2024-11-12 07:09:20,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a60e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:09:20, skipping insertion in model container [2024-11-12 07:09:20,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:09:19" (2/3) ... [2024-11-12 07:09:20,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a60e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:09:20, skipping insertion in model container [2024-11-12 07:09:20,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:09:20" (3/3) ... [2024-11-12 07:09:20,183 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-40.i [2024-11-12 07:09:20,223 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:09:20,224 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:09:20,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:09:20,304 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;@358921d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:09:20,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:09:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 07:09:20,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 07:09:20,325 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:20,326 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:09:20,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:20,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:20,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1897959538, now seen corresponding path program 1 times [2024-11-12 07:09:20,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:09:20,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749476823] [2024-11-12 07:09:20,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:20,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:09:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:09:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:09:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:09:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:09:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:09:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:09:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:09:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:09:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:09:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:09:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:09:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:09:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:09:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:09:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:09:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:09:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:09:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:09:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:09:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 07:09:20,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:09:20,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749476823] [2024-11-12 07:09:20,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749476823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:20,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:20,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:09:20,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132462318] [2024-11-12 07:09:20,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:20,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:09:20,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:09:20,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:09:20,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:09:20,910 INFO L87 Difference]: Start difference. First operand has 113 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 07:09:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:20,953 INFO L93 Difference]: Finished difference Result 219 states and 347 transitions. [2024-11-12 07:09:20,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:09:20,956 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2024-11-12 07:09:20,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:20,966 INFO L225 Difference]: With dead ends: 219 [2024-11-12 07:09:20,967 INFO L226 Difference]: Without dead ends: 109 [2024-11-12 07:09:20,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:09:20,977 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:20,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:09:20,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-12 07:09:21,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-12 07:09:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 07:09:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2024-11-12 07:09:21,027 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 150 [2024-11-12 07:09:21,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:21,027 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2024-11-12 07:09:21,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 07:09:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2024-11-12 07:09:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 07:09:21,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:21,031 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:09:21,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:09:21,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:21,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:21,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1396978404, now seen corresponding path program 1 times [2024-11-12 07:09:21,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:09:21,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192011201] [2024-11-12 07:09:21,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:21,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:09:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:09:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:09:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:09:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:09:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:09:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:09:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:09:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:09:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:09:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:09:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:09:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:09:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:09:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:09:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:09:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:09:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:09:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:09:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:09:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 07:09:21,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:09:21,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192011201] [2024-11-12 07:09:21,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192011201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:21,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:21,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:09:21,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230245671] [2024-11-12 07:09:21,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:21,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:09:21,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:09:21,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:09:21,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:09:21,704 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 07:09:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:21,768 INFO L93 Difference]: Finished difference Result 217 states and 320 transitions. [2024-11-12 07:09:21,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:09:21,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-11-12 07:09:21,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:21,775 INFO L225 Difference]: With dead ends: 217 [2024-11-12 07:09:21,775 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 07:09:21,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:09:21,779 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:21,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:09:21,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 07:09:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-12 07:09:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 07:09:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2024-11-12 07:09:21,799 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 150 [2024-11-12 07:09:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:21,801 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2024-11-12 07:09:21,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 07:09:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2024-11-12 07:09:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 07:09:21,805 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:21,805 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:09:21,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:09:21,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:21,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:21,806 INFO L85 PathProgramCache]: Analyzing trace with hash -677242547, now seen corresponding path program 1 times [2024-11-12 07:09:21,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:09:21,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854032287] [2024-11-12 07:09:21,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:21,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:09:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:21,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:09:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:09:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:09:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:09:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:09:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:09:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:09:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:09:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:09:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:09:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:09:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:09:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:09:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:09:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:09:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:09:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:09:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:09:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:09:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 07:09:22,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:09:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854032287] [2024-11-12 07:09:22,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854032287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:22,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:22,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:09:22,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159171602] [2024-11-12 07:09:22,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:22,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:09:22,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:09:22,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:09:22,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:09:22,089 INFO L87 Difference]: Start difference. First operand 111 states and 162 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 07:09:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:22,134 INFO L93 Difference]: Finished difference Result 222 states and 325 transitions. [2024-11-12 07:09:22,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:09:22,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-12 07:09:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:22,138 INFO L225 Difference]: With dead ends: 222 [2024-11-12 07:09:22,141 INFO L226 Difference]: Without dead ends: 114 [2024-11-12 07:09:22,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:09:22,143 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:22,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 460 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:09:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-12 07:09:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-12 07:09:22,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 07:09:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2024-11-12 07:09:22,158 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 153 [2024-11-12 07:09:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:22,160 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2024-11-12 07:09:22,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 07:09:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2024-11-12 07:09:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 07:09:22,163 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:22,163 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:09:22,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:09:22,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:22,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:22,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2815823, now seen corresponding path program 1 times [2024-11-12 07:09:22,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:09:22,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506517905] [2024-11-12 07:09:22,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:22,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:09:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:09:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:09:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:09:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:09:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:09:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:09:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:09:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:09:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:09:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:09:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:09:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:09:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:09:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:09:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:09:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:09:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:09:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:09:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:09:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 07:09:22,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:09:22,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506517905] [2024-11-12 07:09:22,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506517905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:22,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:22,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:09:22,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997094753] [2024-11-12 07:09:22,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:22,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:09:22,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:09:22,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:09:22,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:09:22,415 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 07:09:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:22,444 INFO L93 Difference]: Finished difference Result 226 states and 329 transitions. [2024-11-12 07:09:22,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:09:22,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-12 07:09:22,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:22,449 INFO L225 Difference]: With dead ends: 226 [2024-11-12 07:09:22,452 INFO L226 Difference]: Without dead ends: 116 [2024-11-12 07:09:22,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:09:22,454 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:22,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:09:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-12 07:09:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-12 07:09:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 07:09:22,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 166 transitions. [2024-11-12 07:09:22,472 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 166 transitions. Word has length 153 [2024-11-12 07:09:22,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:22,473 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 166 transitions. [2024-11-12 07:09:22,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 07:09:22,473 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2024-11-12 07:09:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 07:09:22,476 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:22,476 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:09:22,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:09:22,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:22,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:22,477 INFO L85 PathProgramCache]: Analyzing trace with hash 4662865, now seen corresponding path program 1 times [2024-11-12 07:09:22,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:09:22,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963334452] [2024-11-12 07:09:22,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:22,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:09:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:09:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:09:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:09:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:09:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:09:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:09:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:09:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:09:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:09:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:09:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:09:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:09:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:09:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:09:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:09:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:09:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:09:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:09:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:09:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 07:09:28,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:09:28,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963334452] [2024-11-12 07:09:28,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963334452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:28,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:28,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:09:28,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086907938] [2024-11-12 07:09:28,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:28,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:09:28,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:09:28,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:09:28,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:09:28,912 INFO L87 Difference]: Start difference. First operand 115 states and 166 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 07:09:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:33,192 INFO L93 Difference]: Finished difference Result 418 states and 604 transitions. [2024-11-12 07:09:33,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:09:33,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-11-12 07:09:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:33,195 INFO L225 Difference]: With dead ends: 418 [2024-11-12 07:09:33,196 INFO L226 Difference]: Without dead ends: 306 [2024-11-12 07:09:33,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:09:33,197 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 257 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:33,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1016 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 07:09:33,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-12 07:09:33,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 299. [2024-11-12 07:09:33,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 248 states have (on average 1.3669354838709677) internal successors, (339), 249 states have internal predecessors, (339), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-12 07:09:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 433 transitions. [2024-11-12 07:09:33,245 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 433 transitions. Word has length 153 [2024-11-12 07:09:33,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:33,246 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 433 transitions. [2024-11-12 07:09:33,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 07:09:33,246 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 433 transitions. [2024-11-12 07:09:33,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 07:09:33,248 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:33,248 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:09:33,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:09:33,249 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:33,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:33,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1016405489, now seen corresponding path program 1 times [2024-11-12 07:09:33,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:09:33,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319386823] [2024-11-12 07:09:33,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:33,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:09:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:09:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:09:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:09:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:09:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:09:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:09:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:09:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:09:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:09:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:09:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:09:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:09:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:09:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:09:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:09:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:09:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:09:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:09:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:09:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 07:09:34,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:09:34,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319386823] [2024-11-12 07:09:34,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319386823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:34,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:34,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:09:34,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032262537] [2024-11-12 07:09:34,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:34,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:09:34,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:09:34,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:09:34,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:09:34,263 INFO L87 Difference]: Start difference. First operand 299 states and 433 transitions. Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 07:09:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:34,527 INFO L93 Difference]: Finished difference Result 780 states and 1126 transitions. [2024-11-12 07:09:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:09:34,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-11-12 07:09:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:34,532 INFO L225 Difference]: With dead ends: 780 [2024-11-12 07:09:34,532 INFO L226 Difference]: Without dead ends: 484 [2024-11-12 07:09:34,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:09:34,533 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 114 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:34,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1151 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:09:34,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-12 07:09:34,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 480. [2024-11-12 07:09:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 397 states have (on average 1.350125944584383) internal successors, (536), 400 states have internal predecessors, (536), 77 states have call successors, (77), 5 states have call predecessors, (77), 5 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-12 07:09:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 690 transitions. [2024-11-12 07:09:34,575 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 690 transitions. Word has length 153 [2024-11-12 07:09:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:34,576 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 690 transitions. [2024-11-12 07:09:34,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 07:09:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 690 transitions. [2024-11-12 07:09:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 07:09:34,578 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:34,578 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:09:34,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:09:34,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:34,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash 201377829, now seen corresponding path program 1 times [2024-11-12 07:09:34,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:09:34,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076080460] [2024-11-12 07:09:34,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:34,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:09:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:09:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:09:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:09:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:09:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:09:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:09:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:09:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:09:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:09:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:09:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:09:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:09:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:09:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:09:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:09:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:09:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:09:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:09:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:09:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 07:09:34,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:09:34,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076080460] [2024-11-12 07:09:34,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076080460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:34,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:34,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:09:34,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519501242] [2024-11-12 07:09:34,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:34,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:09:34,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:09:34,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:09:34,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:09:34,776 INFO L87 Difference]: Start difference. First operand 480 states and 690 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 07:09:34,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:34,820 INFO L93 Difference]: Finished difference Result 972 states and 1397 transitions. [2024-11-12 07:09:34,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:09:34,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-12 07:09:34,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:34,824 INFO L225 Difference]: With dead ends: 972 [2024-11-12 07:09:34,824 INFO L226 Difference]: Without dead ends: 495 [2024-11-12 07:09:34,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:09:34,827 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:34,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:09:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-12 07:09:34,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 485. [2024-11-12 07:09:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 402 states have (on average 1.345771144278607) internal successors, (541), 405 states have internal predecessors, (541), 77 states have call successors, (77), 5 states have call predecessors, (77), 5 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-12 07:09:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 695 transitions. [2024-11-12 07:09:34,863 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 695 transitions. Word has length 153 [2024-11-12 07:09:34,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:34,864 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 695 transitions. [2024-11-12 07:09:34,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 07:09:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 695 transitions. [2024-11-12 07:09:34,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 07:09:34,866 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:34,866 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:09:34,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:09:34,866 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:34,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:34,867 INFO L85 PathProgramCache]: Analyzing trace with hash -135885745, now seen corresponding path program 1 times [2024-11-12 07:09:34,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:09:34,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705866271] [2024-11-12 07:09:34,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:34,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:09:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:09:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:09:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:09:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:09:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:09:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:09:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:09:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:09:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:09:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:09:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:09:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:09:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:09:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:09:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:09:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:09:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:09:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:09:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:09:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 07:09:35,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:09:35,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705866271] [2024-11-12 07:09:35,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705866271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:09:35,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:09:35,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:09:35,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977843218] [2024-11-12 07:09:35,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:09:35,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:09:35,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:09:35,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:09:35,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:09:35,790 INFO L87 Difference]: Start difference. First operand 485 states and 695 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-12 07:09:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:09:36,142 INFO L93 Difference]: Finished difference Result 1021 states and 1458 transitions. [2024-11-12 07:09:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:09:36,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2024-11-12 07:09:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:09:36,146 INFO L225 Difference]: With dead ends: 1021 [2024-11-12 07:09:36,146 INFO L226 Difference]: Without dead ends: 539 [2024-11-12 07:09:36,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:09:36,148 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 114 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:09:36,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1509 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:09:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-12 07:09:36,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 397. [2024-11-12 07:09:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 329 states have (on average 1.3525835866261398) internal successors, (445), 331 states have internal predecessors, (445), 62 states have call successors, (62), 5 states have call predecessors, (62), 5 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 07:09:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 569 transitions. [2024-11-12 07:09:36,182 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 569 transitions. Word has length 153 [2024-11-12 07:09:36,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:09:36,182 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 569 transitions. [2024-11-12 07:09:36,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-12 07:09:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 569 transitions. [2024-11-12 07:09:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 07:09:36,184 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:09:36,185 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:09:36,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:09:36,185 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:09:36,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:09:36,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1156954099, now seen corresponding path program 1 times [2024-11-12 07:09:36,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:09:36,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597296709] [2024-11-12 07:09:36,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:36,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:09:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:09:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:40,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:09:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:40,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:09:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:09:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:40,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:09:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:40,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:09:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:40,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:09:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:40,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:09:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:40,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:09:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:40,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:09:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:40,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:09:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:40,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:09:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:40,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:09:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:40,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:09:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:40,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:09:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:41,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:09:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:41,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:09:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:41,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:09:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:41,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:09:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:41,055 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-12 07:09:41,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:09:41,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597296709] [2024-11-12 07:09:41,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597296709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:09:41,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216816203] [2024-11-12 07:09:41,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:09:41,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:09:41,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:09:41,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:09:41,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 07:09:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:09:41,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-12 07:09:41,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:09:41,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 13 [2024-11-12 07:09:41,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 13 [2024-11-12 07:09:41,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 07:09:41,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 12 [2024-11-12 07:09:43,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:09:43,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-11-12 07:09:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 393 proven. 30 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-11-12 07:09:43,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:10:37,378 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 07:10:37,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216816203] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:10:37,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:10:37,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13, 14] total 31 [2024-11-12 07:10:37,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406029503] [2024-11-12 07:10:37,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:10:37,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:10:37,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:10:37,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:10:37,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2024-11-12 07:10:37,381 INFO L87 Difference]: Start difference. First operand 397 states and 569 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)