./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-64.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 e8a04896241e70157c3930e655e8bbdd0596c1c4a370ef6145327105f6ac1c96 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:37:28,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:37:28,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:37:28,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:37:28,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:37:28,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:37:28,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:37:28,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:37:28,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:37:28,883 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:37:28,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:37:28,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:37:28,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:37:28,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:37:28,887 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:37:28,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:37:28,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:37:28,888 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:37:28,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:37:28,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:37:28,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:37:28,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:37:28,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:37:28,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:37:28,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:37:28,895 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:37:28,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:37:28,895 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:37:28,896 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:37:28,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:37:28,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:37:28,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:37:28,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:37:28,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:37:28,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:37:28,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:37:28,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:37:28,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:37:28,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:37:28,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:37:28,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:37:28,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:37:28,901 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 -> e8a04896241e70157c3930e655e8bbdd0596c1c4a370ef6145327105f6ac1c96 [2024-10-14 13:37:29,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:37:29,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:37:29,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:37:29,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:37:29,215 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:37:29,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-64.i [2024-10-14 13:37:30,690 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:37:30,893 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:37:30,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-64.i [2024-10-14 13:37:30,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afa5f66a1/69bdfc671ab042aa881235dfe791932e/FLAGf93cd4d98 [2024-10-14 13:37:30,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afa5f66a1/69bdfc671ab042aa881235dfe791932e [2024-10-14 13:37:30,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:37:30,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:37:30,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:37:30,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:37:30,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:37:30,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:37:30" (1/1) ... [2024-10-14 13:37:30,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd346f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:30, skipping insertion in model container [2024-10-14 13:37:30,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:37:30" (1/1) ... [2024-10-14 13:37:30,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:37:31,122 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-64.i[917,930] [2024-10-14 13:37:31,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:37:31,242 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:37:31,257 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-64.i[917,930] [2024-10-14 13:37:31,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:37:31,330 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:37:31,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:31 WrapperNode [2024-10-14 13:37:31,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:37:31,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:37:31,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:37:31,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:37:31,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:31" (1/1) ... [2024-10-14 13:37:31,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:31" (1/1) ... [2024-10-14 13:37:31,404 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 542 [2024-10-14 13:37:31,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:37:31,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:37:31,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:37:31,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:37:31,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:31" (1/1) ... [2024-10-14 13:37:31,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:31" (1/1) ... [2024-10-14 13:37:31,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:31" (1/1) ... [2024-10-14 13:37:31,450 INFO L175 MemorySlicer]: Split 131 memory accesses to 8 slices as follows [2, 21, 25, 24, 3, 22, 27, 7]. 21 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 3, 2, 3, 1, 2, 3, 1]. The 18 writes are split as follows [0, 3, 3, 3, 1, 4, 3, 1]. [2024-10-14 13:37:31,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:31" (1/1) ... [2024-10-14 13:37:31,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:31" (1/1) ... [2024-10-14 13:37:31,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:31" (1/1) ... [2024-10-14 13:37:31,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:31" (1/1) ... [2024-10-14 13:37:31,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:31" (1/1) ... [2024-10-14 13:37:31,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:31" (1/1) ... [2024-10-14 13:37:31,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:37:31,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:37:31,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:37:31,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:37:31,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:31" (1/1) ... [2024-10-14 13:37:31,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:37:31,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:37:31,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:37:31,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:37:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:37:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:37:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:37:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:37:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:37:31,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:37:31,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:37:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-14 13:37:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-14 13:37:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 13:37:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 13:37:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-14 13:37:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-14 13:37:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-14 13:37:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-14 13:37:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-14 13:37:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-14 13:37:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 13:37:31,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 13:37:31,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-14 13:37:31,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-14 13:37:31,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-14 13:37:31,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-14 13:37:31,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-14 13:37:31,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-14 13:37:31,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:37:31,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:37:31,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:37:31,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:37:31,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:37:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:37:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-14 13:37:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-14 13:37:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 13:37:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 13:37:31,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-14 13:37:31,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-14 13:37:31,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-14 13:37:31,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-14 13:37:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-14 13:37:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-14 13:37:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:37:31,636 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:37:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:37:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:37:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:37:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:37:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:37:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:37:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 13:37:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 13:37:31,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:37:31,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:37:31,824 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:37:31,826 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:37:32,504 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2024-10-14 13:37:32,504 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:37:32,555 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:37:32,556 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:37:32,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:37:32 BoogieIcfgContainer [2024-10-14 13:37:32,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:37:32,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:37:32,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:37:32,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:37:32,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:37:30" (1/3) ... [2024-10-14 13:37:32,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7c49e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:37:32, skipping insertion in model container [2024-10-14 13:37:32,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:37:31" (2/3) ... [2024-10-14 13:37:32,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7c49e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:37:32, skipping insertion in model container [2024-10-14 13:37:32,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:37:32" (3/3) ... [2024-10-14 13:37:32,568 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-64.i [2024-10-14 13:37:32,588 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:37:32,588 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:37:32,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:37:32,678 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;@71ee8f75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:37:32,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:37:32,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 100 states have internal predecessors, (145), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 13:37:32,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:32,700 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:37:32,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:32,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:32,706 INFO L85 PathProgramCache]: Analyzing trace with hash -326865835, now seen corresponding path program 1 times [2024-10-14 13:37:32,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:32,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601963360] [2024-10-14 13:37:32,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:32,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:37:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:37:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:37:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:37:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:37:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:37:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:37:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:37:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:37:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:37:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:37:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:37:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:37:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:37:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:37:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 13:37:33,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:33,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601963360] [2024-10-14 13:37:33,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601963360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:33,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:33,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:37:33,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143289280] [2024-10-14 13:37:33,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:33,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:37:33,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:33,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:37:33,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:37:33,258 INFO L87 Difference]: Start difference. First operand has 122 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 100 states have internal predecessors, (145), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:37:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:33,316 INFO L93 Difference]: Finished difference Result 241 states and 388 transitions. [2024-10-14 13:37:33,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:37:33,321 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2024-10-14 13:37:33,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:33,331 INFO L225 Difference]: With dead ends: 241 [2024-10-14 13:37:33,332 INFO L226 Difference]: Without dead ends: 120 [2024-10-14 13:37:33,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:37:33,340 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:33,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:37:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-14 13:37:33,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-14 13:37:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 98 states have internal predecessors, (140), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 180 transitions. [2024-10-14 13:37:33,410 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 180 transitions. Word has length 154 [2024-10-14 13:37:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:33,412 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 180 transitions. [2024-10-14 13:37:33,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:37:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 180 transitions. [2024-10-14 13:37:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 13:37:33,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:33,419 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:37:33,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:37:33,420 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:33,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:33,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2107923381, now seen corresponding path program 1 times [2024-10-14 13:37:33,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:33,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587472937] [2024-10-14 13:37:33,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:33,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:37:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:37:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:37:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:37:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:37:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:37:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:37:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:37:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:37:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:37:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:37:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:37:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:37:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:37:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:37:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 13:37:33,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:33,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587472937] [2024-10-14 13:37:33,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587472937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:33,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:33,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:37:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042167924] [2024-10-14 13:37:33,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:33,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:37:33,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:33,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:37:33,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:37:33,919 INFO L87 Difference]: Start difference. First operand 120 states and 180 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:37:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:33,987 INFO L93 Difference]: Finished difference Result 241 states and 362 transitions. [2024-10-14 13:37:33,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:37:33,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2024-10-14 13:37:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:33,990 INFO L225 Difference]: With dead ends: 241 [2024-10-14 13:37:33,990 INFO L226 Difference]: Without dead ends: 122 [2024-10-14 13:37:33,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:37:33,992 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:33,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:37:33,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-14 13:37:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-14 13:37:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.42) internal successors, (142), 100 states have internal predecessors, (142), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 182 transitions. [2024-10-14 13:37:34,014 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 182 transitions. Word has length 154 [2024-10-14 13:37:34,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:34,016 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 182 transitions. [2024-10-14 13:37:34,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 13:37:34,016 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 182 transitions. [2024-10-14 13:37:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 13:37:34,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:34,021 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:37:34,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:37:34,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:34,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:34,022 INFO L85 PathProgramCache]: Analyzing trace with hash -55693193, now seen corresponding path program 1 times [2024-10-14 13:37:34,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:34,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550195630] [2024-10-14 13:37:34,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:34,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:37:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:37:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:37:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:37:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:37:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:37:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:37:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:37:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:37:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:37:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:37:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:37:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:37:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:37:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:37:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 13:37:34,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:34,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550195630] [2024-10-14 13:37:34,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550195630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:34,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:34,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:37:34,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814048617] [2024-10-14 13:37:34,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:34,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:37:34,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:34,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:37:34,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:37:34,399 INFO L87 Difference]: Start difference. First operand 122 states and 182 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 13:37:34,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:34,445 INFO L93 Difference]: Finished difference Result 245 states and 366 transitions. [2024-10-14 13:37:34,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:37:34,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-10-14 13:37:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:34,448 INFO L225 Difference]: With dead ends: 245 [2024-10-14 13:37:34,449 INFO L226 Difference]: Without dead ends: 124 [2024-10-14 13:37:34,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:37:34,451 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:34,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:37:34,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-14 13:37:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-14 13:37:34,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 102 states have (on average 1.411764705882353) internal successors, (144), 102 states have internal predecessors, (144), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:34,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2024-10-14 13:37:34,462 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 154 [2024-10-14 13:37:34,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:34,463 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2024-10-14 13:37:34,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 13:37:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2024-10-14 13:37:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 13:37:34,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:34,469 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:37:34,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:37:34,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:34,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash 866530981, now seen corresponding path program 1 times [2024-10-14 13:37:34,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:34,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637648237] [2024-10-14 13:37:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:34,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:37:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:37:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:37:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:37:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:37:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:37:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:37:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:37:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:37:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:37:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:37:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:37:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:37:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:37:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:37:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 13:37:34,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:34,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637648237] [2024-10-14 13:37:34,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637648237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:34,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:34,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:37:34,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188668287] [2024-10-14 13:37:34,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:34,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:37:34,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:34,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:37:34,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:37:34,799 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 13:37:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:34,854 INFO L93 Difference]: Finished difference Result 250 states and 371 transitions. [2024-10-14 13:37:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:37:34,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-10-14 13:37:34,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:34,859 INFO L225 Difference]: With dead ends: 250 [2024-10-14 13:37:34,862 INFO L226 Difference]: Without dead ends: 127 [2024-10-14 13:37:34,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-10-14 13:37:34,864 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:34,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 681 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:37:34,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-14 13:37:34,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-10-14 13:37:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 13:37:34,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 187 transitions. [2024-10-14 13:37:34,883 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 187 transitions. Word has length 156 [2024-10-14 13:37:34,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:34,887 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 187 transitions. [2024-10-14 13:37:34,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 13:37:34,887 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 187 transitions. [2024-10-14 13:37:34,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-14 13:37:34,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:34,889 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:37:34,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:37:34,890 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:34,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:34,890 INFO L85 PathProgramCache]: Analyzing trace with hash -356787088, now seen corresponding path program 1 times [2024-10-14 13:37:34,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:34,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111744793] [2024-10-14 13:37:34,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:34,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:37:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:37:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:37:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:37:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:37:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:37:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:37:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:37:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:37:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:37:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:37:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:37:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:37:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:37:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:37:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 13:37:35,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:35,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111744793] [2024-10-14 13:37:35,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111744793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:37:35,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:37:35,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:37:35,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812724358] [2024-10-14 13:37:35,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:37:35,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:37:35,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:35,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:37:35,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:37:35,645 INFO L87 Difference]: Start difference. First operand 127 states and 187 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 13:37:36,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:36,157 INFO L93 Difference]: Finished difference Result 429 states and 630 transitions. [2024-10-14 13:37:36,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:37:36,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-10-14 13:37:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:36,162 INFO L225 Difference]: With dead ends: 429 [2024-10-14 13:37:36,164 INFO L226 Difference]: Without dead ends: 303 [2024-10-14 13:37:36,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:37:36,167 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 253 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:36,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 825 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:37:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-14 13:37:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 212. [2024-10-14 13:37:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 169 states have (on average 1.378698224852071) internal successors, (233), 169 states have internal predecessors, (233), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 13:37:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 313 transitions. [2024-10-14 13:37:36,196 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 313 transitions. Word has length 157 [2024-10-14 13:37:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:36,197 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 313 transitions. [2024-10-14 13:37:36,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 13:37:36,197 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 313 transitions. [2024-10-14 13:37:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-14 13:37:36,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:36,199 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:37:36,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:37:36,200 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:36,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:36,200 INFO L85 PathProgramCache]: Analyzing trace with hash -898774144, now seen corresponding path program 1 times [2024-10-14 13:37:36,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:36,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467641209] [2024-10-14 13:37:36,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:36,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:37:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:37:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:37:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:37:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:37:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:37:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 13:37:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 13:37:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:37:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:37:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:37:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:37:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 13:37:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 13:37:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 13:37:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 13:37:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 13:37:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 13:37:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 13:37:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 13:37:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-14 13:37:37,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:37,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467641209] [2024-10-14 13:37:37,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467641209] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:37:37,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377722821] [2024-10-14 13:37:37,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:37,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:37:37,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:37:37,401 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:37:37,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 13:37:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:37,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-14 13:37:37,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:37:37,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 13:37:38,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-10-14 13:37:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 1 proven. 147 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 13:37:40,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:37:41,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377722821] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:37:41,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:37:41,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 23 [2024-10-14 13:37:41,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999541409] [2024-10-14 13:37:41,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 13:37:41,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 13:37:41,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:41,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 13:37:41,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2024-10-14 13:37:41,835 INFO L87 Difference]: Start difference. First operand 212 states and 313 transitions. Second operand has 23 states, 21 states have (on average 6.0) internal successors, (126), 23 states have internal predecessors, (126), 7 states have call successors, (40), 4 states have call predecessors, (40), 5 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) [2024-10-14 13:37:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:45,152 INFO L93 Difference]: Finished difference Result 601 states and 872 transitions. [2024-10-14 13:37:45,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-10-14 13:37:45,153 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.0) internal successors, (126), 23 states have internal predecessors, (126), 7 states have call successors, (40), 4 states have call predecessors, (40), 5 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) Word has length 158 [2024-10-14 13:37:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:45,156 INFO L225 Difference]: With dead ends: 601 [2024-10-14 13:37:45,158 INFO L226 Difference]: Without dead ends: 458 [2024-10-14 13:37:45,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=597, Invalid=3825, Unknown=0, NotChecked=0, Total=4422 [2024-10-14 13:37:45,162 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1269 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:45,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 1903 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 13:37:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-14 13:37:45,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 330. [2024-10-14 13:37:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 263 states have (on average 1.361216730038023) internal successors, (358), 263 states have internal predecessors, (358), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 13:37:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 478 transitions. [2024-10-14 13:37:45,221 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 478 transitions. Word has length 158 [2024-10-14 13:37:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:45,222 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 478 transitions. [2024-10-14 13:37:45,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.0) internal successors, (126), 23 states have internal predecessors, (126), 7 states have call successors, (40), 4 states have call predecessors, (40), 5 states have return successors, (40), 5 states have call predecessors, (40), 7 states have call successors, (40) [2024-10-14 13:37:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 478 transitions. [2024-10-14 13:37:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 13:37:45,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:45,226 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:37:45,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 13:37:45,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 13:37:45,427 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:45,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:45,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1923679670, now seen corresponding path program 1 times [2024-10-14 13:37:45,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:45,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741135512] [2024-10-14 13:37:45,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:45,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:37:45,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [690502671] [2024-10-14 13:37:45,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:45,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:37:45,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:37:45,669 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 13:37:45,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 13:37:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:37:46,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 13:37:46,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:37:46,293 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-10-14 13:37:46,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 13:37:46,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-14 13:37:46,508 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 30 treesize of output 14 [2024-10-14 13:37:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 134 proven. 306 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-10-14 13:37:46,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:37:46,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:37:46,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741135512] [2024-10-14 13:37:46,748 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 13:37:46,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690502671] [2024-10-14 13:37:46,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690502671] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:37:46,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:37:46,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-10-14 13:37:46,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284349794] [2024-10-14 13:37:46,749 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 13:37:46,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:37:46,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:37:46,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:37:46,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:37:46,751 INFO L87 Difference]: Start difference. First operand 330 states and 478 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-14 13:37:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:37:47,102 INFO L93 Difference]: Finished difference Result 607 states and 871 transitions. [2024-10-14 13:37:47,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 13:37:47,103 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 159 [2024-10-14 13:37:47,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:37:47,106 INFO L225 Difference]: With dead ends: 607 [2024-10-14 13:37:47,106 INFO L226 Difference]: Without dead ends: 354 [2024-10-14 13:37:47,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-10-14 13:37:47,107 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 146 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:37:47,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 607 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:37:47,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-14 13:37:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 342. [2024-10-14 13:37:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 272 states have (on average 1.3419117647058822) internal successors, (365), 272 states have internal predecessors, (365), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 13:37:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 485 transitions. [2024-10-14 13:37:47,145 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 485 transitions. Word has length 159 [2024-10-14 13:37:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:37:47,145 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 485 transitions. [2024-10-14 13:37:47,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-14 13:37:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 485 transitions. [2024-10-14 13:37:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 13:37:47,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:37:47,176 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:37:47,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 13:37:47,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-14 13:37:47,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:37:47,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:37:47,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2057693176, now seen corresponding path program 1 times [2024-10-14 13:37:47,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:37:47,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151247179] [2024-10-14 13:37:47,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:37:47,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:37:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat