./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-p_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-18.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 8167bb57c72da66729eaf4d0bfb99f298c96636d95817c5a55fbaebfee04d766 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:15:13,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:15:13,931 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:15:13,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:15:13,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:15:13,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:15:13,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:15:13,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:15:13,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:15:13,969 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:15:13,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:15:13,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:15:13,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:15:13,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:15:13,971 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:15:13,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:15:13,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:15:13,972 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:15:13,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:15:13,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:15:13,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:15:13,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:15:13,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:15:13,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:15:13,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:15:13,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:15:13,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:15:13,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:15:13,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:15:13,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:15:13,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:15:13,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:15:13,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:15:13,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:15:13,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:15:13,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:15:13,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:15:13,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:15:13,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:15:13,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:15:13,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:15:13,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:15:13,982 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 -> 8167bb57c72da66729eaf4d0bfb99f298c96636d95817c5a55fbaebfee04d766 [2024-10-13 06:15:14,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:15:14,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:15:14,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:15:14,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:15:14,279 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:15:14,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-18.i [2024-10-13 06:15:15,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:15:16,011 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:15:16,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-18.i [2024-10-13 06:15:16,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af387e5bc/203ea5a335a54b93b8ea80326feeeee1/FLAGd6105bfdd [2024-10-13 06:15:16,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af387e5bc/203ea5a335a54b93b8ea80326feeeee1 [2024-10-13 06:15:16,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:15:16,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:15:16,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:15:16,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:15:16,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:15:16,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:15:16" (1/1) ... [2024-10-13 06:15:16,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390c0ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:16, skipping insertion in model container [2024-10-13 06:15:16,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:15:16" (1/1) ... [2024-10-13 06:15:16,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:15:16,250 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-p_file-18.i[916,929] [2024-10-13 06:15:16,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:15:16,328 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:15:16,346 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-p_file-18.i[916,929] [2024-10-13 06:15:16,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:15:16,422 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:15:16,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:16 WrapperNode [2024-10-13 06:15:16,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:15:16,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:15:16,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:15:16,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:15:16,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:16" (1/1) ... [2024-10-13 06:15:16,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:16" (1/1) ... [2024-10-13 06:15:16,586 INFO L138 Inliner]: procedures = 29, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2024-10-13 06:15:16,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:15:16,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:15:16,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:15:16,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:15:16,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:16" (1/1) ... [2024-10-13 06:15:16,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:16" (1/1) ... [2024-10-13 06:15:16,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:16" (1/1) ... [2024-10-13 06:15:16,653 INFO L175 MemorySlicer]: Split 115 memory accesses to 11 slices as follows [2, 5, 14, 8, 12, 12, 26, 12, 8, 10, 6]. 23 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 13 writes are split as follows [0, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1]. [2024-10-13 06:15:16,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:16" (1/1) ... [2024-10-13 06:15:16,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:16" (1/1) ... [2024-10-13 06:15:16,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:16" (1/1) ... [2024-10-13 06:15:16,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:16" (1/1) ... [2024-10-13 06:15:16,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:16" (1/1) ... [2024-10-13 06:15:16,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:16" (1/1) ... [2024-10-13 06:15:16,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:15:16,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:15:16,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:15:16,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:15:16,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:16" (1/1) ... [2024-10-13 06:15:16,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:15:16,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:15:16,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:15:16,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:15:16,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:15:16,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:15:16,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:15:16,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-13 06:15:16,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-13 06:15:16,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-13 06:15:16,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-13 06:15:16,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-13 06:15:16,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-13 06:15:16,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-13 06:15:16,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-13 06:15:16,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-13 06:15:16,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:15:16,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:15:16,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 06:15:16,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 06:15:16,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 06:15:16,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 06:15:16,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 06:15:16,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 06:15:16,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-13 06:15:16,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-13 06:15:16,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-13 06:15:16,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:15:16,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:15:16,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-13 06:15:16,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-13 06:15:16,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-13 06:15:16,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-13 06:15:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-13 06:15:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-13 06:15:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-13 06:15:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-13 06:15:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-13 06:15:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:15:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:15:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 06:15:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 06:15:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 06:15:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 06:15:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 06:15:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 06:15:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-13 06:15:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-13 06:15:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-13 06:15:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:15:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:15:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-13 06:15:16,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-13 06:15:16,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-13 06:15:16,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-13 06:15:16,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-13 06:15:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-13 06:15:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-13 06:15:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-13 06:15:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-13 06:15:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:15:16,830 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:15:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:15:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:15:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 06:15:16,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 06:15:16,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 06:15:16,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 06:15:16,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 06:15:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 06:15:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-13 06:15:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-13 06:15:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-13 06:15:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:15:16,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:15:17,049 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:15:17,051 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:15:17,620 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-10-13 06:15:17,621 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:15:17,671 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:15:17,671 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:15:17,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:15:17 BoogieIcfgContainer [2024-10-13 06:15:17,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:15:17,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:15:17,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:15:17,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:15:17,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:15:16" (1/3) ... [2024-10-13 06:15:17,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f034a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:15:17, skipping insertion in model container [2024-10-13 06:15:17,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:16" (2/3) ... [2024-10-13 06:15:17,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f034a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:15:17, skipping insertion in model container [2024-10-13 06:15:17,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:15:17" (3/3) ... [2024-10-13 06:15:17,683 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-18.i [2024-10-13 06:15:17,697 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:15:17,698 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:15:17,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:15:17,782 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;@4fcd183f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:15:17,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:15:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 86 states have (on average 1.5) internal successors, (129), 87 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:15:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 06:15:17,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:17,800 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:17,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:17,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash 663539743, now seen corresponding path program 1 times [2024-10-13 06:15:17,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:17,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305416652] [2024-10-13 06:15:17,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:17,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:18,308 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:18,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:18,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305416652] [2024-10-13 06:15:18,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305416652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:18,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:18,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:15:18,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820720645] [2024-10-13 06:15:18,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:18,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:15:18,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:18,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:15:18,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:15:18,359 INFO L87 Difference]: Start difference. First operand has 101 states, 86 states have (on average 1.5) internal successors, (129), 87 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:15:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:18,441 INFO L93 Difference]: Finished difference Result 199 states and 316 transitions. [2024-10-13 06:15:18,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:15:18,449 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2024-10-13 06:15:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:18,461 INFO L225 Difference]: With dead ends: 199 [2024-10-13 06:15:18,462 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 06:15:18,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:15:18,469 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:18,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:15:18,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 06:15:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-13 06:15:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 85 states have internal predecessors, (124), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:15:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 148 transitions. [2024-10-13 06:15:18,564 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 148 transitions. Word has length 102 [2024-10-13 06:15:18,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:18,565 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 148 transitions. [2024-10-13 06:15:18,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:15:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 148 transitions. [2024-10-13 06:15:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 06:15:18,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:18,569 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:18,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:15:18,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:18,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:18,570 INFO L85 PathProgramCache]: Analyzing trace with hash 747061707, now seen corresponding path program 1 times [2024-10-13 06:15:18,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:18,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859558105] [2024-10-13 06:15:18,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:18,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:19,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:19,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859558105] [2024-10-13 06:15:19,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859558105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:19,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:19,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:15:19,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366427252] [2024-10-13 06:15:19,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:19,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:15:19,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:19,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:15:19,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:19,579 INFO L87 Difference]: Start difference. First operand 99 states and 148 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:19,879 INFO L93 Difference]: Finished difference Result 295 states and 442 transitions. [2024-10-13 06:15:19,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:15:19,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-13 06:15:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:19,882 INFO L225 Difference]: With dead ends: 295 [2024-10-13 06:15:19,884 INFO L226 Difference]: Without dead ends: 197 [2024-10-13 06:15:19,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:15:19,887 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 150 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:19,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 584 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:15:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-13 06:15:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2024-10-13 06:15:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 165 states have (on average 1.4545454545454546) internal successors, (240), 165 states have internal predecessors, (240), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:15:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 288 transitions. [2024-10-13 06:15:19,938 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 288 transitions. Word has length 102 [2024-10-13 06:15:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:19,938 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 288 transitions. [2024-10-13 06:15:19,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 288 transitions. [2024-10-13 06:15:19,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:15:19,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:19,941 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:19,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:15:19,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:19,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:19,942 INFO L85 PathProgramCache]: Analyzing trace with hash -876179358, now seen corresponding path program 1 times [2024-10-13 06:15:19,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:19,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601732967] [2024-10-13 06:15:19,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:19,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:20,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:20,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601732967] [2024-10-13 06:15:20,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601732967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:20,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:20,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:15:20,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888560304] [2024-10-13 06:15:20,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:20,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:15:20,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:20,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:15:20,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:20,570 INFO L87 Difference]: Start difference. First operand 192 states and 288 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:20,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:20,803 INFO L93 Difference]: Finished difference Result 388 states and 581 transitions. [2024-10-13 06:15:20,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:15:20,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-13 06:15:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:20,809 INFO L225 Difference]: With dead ends: 388 [2024-10-13 06:15:20,810 INFO L226 Difference]: Without dead ends: 197 [2024-10-13 06:15:20,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:15:20,815 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 236 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:20,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 576 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:15:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-13 06:15:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2024-10-13 06:15:20,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 165 states have (on average 1.4484848484848485) internal successors, (239), 165 states have internal predecessors, (239), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:15:20,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 287 transitions. [2024-10-13 06:15:20,845 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 287 transitions. Word has length 103 [2024-10-13 06:15:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:20,846 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 287 transitions. [2024-10-13 06:15:20,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 287 transitions. [2024-10-13 06:15:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:15:20,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:20,854 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:20,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:15:20,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:20,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:20,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1361391120, now seen corresponding path program 1 times [2024-10-13 06:15:20,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:20,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190370711] [2024-10-13 06:15:20,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:20,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:21,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:21,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190370711] [2024-10-13 06:15:21,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190370711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:21,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:21,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:15:21,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877412726] [2024-10-13 06:15:21,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:21,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:15:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:21,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:15:21,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:21,474 INFO L87 Difference]: Start difference. First operand 192 states and 287 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:21,588 INFO L93 Difference]: Finished difference Result 292 states and 437 transitions. [2024-10-13 06:15:21,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:15:21,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-13 06:15:21,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:21,592 INFO L225 Difference]: With dead ends: 292 [2024-10-13 06:15:21,593 INFO L226 Difference]: Without dead ends: 194 [2024-10-13 06:15:21,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:21,595 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 5 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:21,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 611 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:15:21,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-13 06:15:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2024-10-13 06:15:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 166 states have (on average 1.4457831325301205) internal successors, (240), 166 states have internal predecessors, (240), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:15:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 288 transitions. [2024-10-13 06:15:21,621 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 288 transitions. Word has length 103 [2024-10-13 06:15:21,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:21,622 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 288 transitions. [2024-10-13 06:15:21,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:21,623 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 288 transitions. [2024-10-13 06:15:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:15:21,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:21,627 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:21,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:15:21,627 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:21,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:21,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1912507822, now seen corresponding path program 1 times [2024-10-13 06:15:21,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:21,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368993795] [2024-10-13 06:15:21,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:21,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:22,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:22,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368993795] [2024-10-13 06:15:22,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368993795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:22,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:22,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:15:22,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802339735] [2024-10-13 06:15:22,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:22,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:15:22,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:22,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:15:22,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:22,107 INFO L87 Difference]: Start difference. First operand 193 states and 288 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:22,357 INFO L93 Difference]: Finished difference Result 389 states and 581 transitions. [2024-10-13 06:15:22,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:15:22,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-13 06:15:22,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:22,360 INFO L225 Difference]: With dead ends: 389 [2024-10-13 06:15:22,360 INFO L226 Difference]: Without dead ends: 290 [2024-10-13 06:15:22,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:15:22,362 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 250 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:22,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 710 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:15:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-13 06:15:22,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 285. [2024-10-13 06:15:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 245 states have (on average 1.4408163265306122) internal successors, (353), 245 states have internal predecessors, (353), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:15:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 425 transitions. [2024-10-13 06:15:22,381 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 425 transitions. Word has length 103 [2024-10-13 06:15:22,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:22,382 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 425 transitions. [2024-10-13 06:15:22,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 425 transitions. [2024-10-13 06:15:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:15:22,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:22,384 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:22,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:15:22,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:22,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:22,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1681394896, now seen corresponding path program 1 times [2024-10-13 06:15:22,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:22,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423112161] [2024-10-13 06:15:22,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:22,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-13 06:15:23,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:23,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423112161] [2024-10-13 06:15:23,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423112161] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:15:23,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762612938] [2024-10-13 06:15:23,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:23,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:15:23,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:15:23,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:15:23,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 06:15:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:23,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-13 06:15:23,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:15:23,659 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-13 06:15:24,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-10-13 06:15:24,126 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-13 06:15:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:15:24,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:15:24,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-13 06:15:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-13 06:15:24,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762612938] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:15:24,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 06:15:24,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 29 [2024-10-13 06:15:24,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146902876] [2024-10-13 06:15:24,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 06:15:24,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-13 06:15:24,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:24,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-13 06:15:24,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2024-10-13 06:15:24,844 INFO L87 Difference]: Start difference. First operand 285 states and 425 transitions. Second operand has 29 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 28 states have internal predecessors, (99), 5 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 5 states have call successors, (36) [2024-10-13 06:15:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:26,520 INFO L93 Difference]: Finished difference Result 913 states and 1342 transitions. [2024-10-13 06:15:26,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-13 06:15:26,521 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 28 states have internal predecessors, (99), 5 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 5 states have call successors, (36) Word has length 103 [2024-10-13 06:15:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:26,527 INFO L225 Difference]: With dead ends: 913 [2024-10-13 06:15:26,528 INFO L226 Difference]: Without dead ends: 629 [2024-10-13 06:15:26,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=572, Invalid=2398, Unknown=0, NotChecked=0, Total=2970 [2024-10-13 06:15:26,532 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 944 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:26,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 2269 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 06:15:26,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-10-13 06:15:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 611. [2024-10-13 06:15:26,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 526 states have (on average 1.3897338403041826) internal successors, (731), 526 states have internal predecessors, (731), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 06:15:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 875 transitions. [2024-10-13 06:15:26,612 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 875 transitions. Word has length 103 [2024-10-13 06:15:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:26,612 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 875 transitions. [2024-10-13 06:15:26,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 28 states have internal predecessors, (99), 5 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 5 states have call successors, (36) [2024-10-13 06:15:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 875 transitions. [2024-10-13 06:15:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 06:15:26,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:26,615 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:26,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 06:15:26,819 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-13 06:15:26,821 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:26,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:26,821 INFO L85 PathProgramCache]: Analyzing trace with hash 436994562, now seen corresponding path program 1 times [2024-10-13 06:15:26,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:26,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121755001] [2024-10-13 06:15:26,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:26,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:27,771 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:27,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:27,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121755001] [2024-10-13 06:15:27,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121755001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:27,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:27,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:15:27,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234764328] [2024-10-13 06:15:27,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:27,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:15:27,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:27,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:15:27,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:15:27,774 INFO L87 Difference]: Start difference. First operand 611 states and 875 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:28,213 INFO L93 Difference]: Finished difference Result 1037 states and 1479 transitions. [2024-10-13 06:15:28,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:15:28,214 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-10-13 06:15:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:28,219 INFO L225 Difference]: With dead ends: 1037 [2024-10-13 06:15:28,219 INFO L226 Difference]: Without dead ends: 727 [2024-10-13 06:15:28,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:15:28,221 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 298 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:28,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1043 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:15:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-13 06:15:28,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 619. [2024-10-13 06:15:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 534 states have (on average 1.3876404494382022) internal successors, (741), 534 states have internal predecessors, (741), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 06:15:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 885 transitions. [2024-10-13 06:15:28,282 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 885 transitions. Word has length 106 [2024-10-13 06:15:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:28,283 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 885 transitions. [2024-10-13 06:15:28,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:28,284 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 885 transitions. [2024-10-13 06:15:28,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 06:15:28,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:28,287 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:28,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:15:28,287 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:28,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:28,288 INFO L85 PathProgramCache]: Analyzing trace with hash 163097645, now seen corresponding path program 1 times [2024-10-13 06:15:28,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:28,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792433524] [2024-10-13 06:15:28,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:28,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:28,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:28,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792433524] [2024-10-13 06:15:28,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792433524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:28,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:28,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:15:28,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629566204] [2024-10-13 06:15:28,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:28,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:15:28,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:28,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:15:28,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:28,681 INFO L87 Difference]: Start difference. First operand 619 states and 885 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:28,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:28,899 INFO L93 Difference]: Finished difference Result 1249 states and 1786 transitions. [2024-10-13 06:15:28,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:15:28,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-10-13 06:15:28,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:28,904 INFO L225 Difference]: With dead ends: 1249 [2024-10-13 06:15:28,904 INFO L226 Difference]: Without dead ends: 631 [2024-10-13 06:15:28,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:15:28,907 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 148 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:28,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 648 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:15:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-10-13 06:15:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 621. [2024-10-13 06:15:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 536 states have (on average 1.3861940298507462) internal successors, (743), 536 states have internal predecessors, (743), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 06:15:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 887 transitions. [2024-10-13 06:15:28,962 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 887 transitions. Word has length 106 [2024-10-13 06:15:28,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:28,963 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 887 transitions. [2024-10-13 06:15:28,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 887 transitions. [2024-10-13 06:15:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 06:15:28,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:28,965 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:28,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:15:28,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:28,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1831047061, now seen corresponding path program 1 times [2024-10-13 06:15:28,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:28,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997388682] [2024-10-13 06:15:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:28,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:29,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:29,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997388682] [2024-10-13 06:15:29,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997388682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:29,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:29,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:15:29,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851617089] [2024-10-13 06:15:29,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:29,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:15:29,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:29,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:15:29,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:29,352 INFO L87 Difference]: Start difference. First operand 621 states and 887 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:29,587 INFO L93 Difference]: Finished difference Result 1251 states and 1786 transitions. [2024-10-13 06:15:29,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:15:29,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-10-13 06:15:29,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:29,592 INFO L225 Difference]: With dead ends: 1251 [2024-10-13 06:15:29,592 INFO L226 Difference]: Without dead ends: 631 [2024-10-13 06:15:29,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:15:29,596 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 237 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:29,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 607 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:15:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-10-13 06:15:29,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 621. [2024-10-13 06:15:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 536 states have (on average 1.382462686567164) internal successors, (741), 536 states have internal predecessors, (741), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 06:15:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 885 transitions. [2024-10-13 06:15:29,645 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 885 transitions. Word has length 106 [2024-10-13 06:15:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:29,646 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 885 transitions. [2024-10-13 06:15:29,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 885 transitions. [2024-10-13 06:15:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 06:15:29,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:29,648 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:29,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:15:29,648 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:29,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:29,649 INFO L85 PathProgramCache]: Analyzing trace with hash -554649835, now seen corresponding path program 1 times [2024-10-13 06:15:29,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:29,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499126277] [2024-10-13 06:15:29,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:29,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:29,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:29,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499126277] [2024-10-13 06:15:29,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499126277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:29,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:29,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:15:29,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218650914] [2024-10-13 06:15:29,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:29,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:15:29,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:29,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:15:29,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:15:29,861 INFO L87 Difference]: Start difference. First operand 621 states and 885 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:29,922 INFO L93 Difference]: Finished difference Result 1259 states and 1793 transitions. [2024-10-13 06:15:29,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:15:29,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-10-13 06:15:29,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:29,929 INFO L225 Difference]: With dead ends: 1259 [2024-10-13 06:15:29,929 INFO L226 Difference]: Without dead ends: 639 [2024-10-13 06:15:29,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-13 06:15:29,931 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:29,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:15:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-10-13 06:15:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2024-10-13 06:15:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 554 states have (on average 1.3700361010830324) internal successors, (759), 554 states have internal predecessors, (759), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 06:15:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 903 transitions. [2024-10-13 06:15:29,976 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 903 transitions. Word has length 106 [2024-10-13 06:15:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:29,977 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 903 transitions. [2024-10-13 06:15:29,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:29,977 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 903 transitions. [2024-10-13 06:15:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 06:15:29,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:29,980 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:29,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:15:29,980 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:29,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:29,981 INFO L85 PathProgramCache]: Analyzing trace with hash -311179742, now seen corresponding path program 1 times [2024-10-13 06:15:29,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:29,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149863929] [2024-10-13 06:15:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:29,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:30,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:30,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149863929] [2024-10-13 06:15:30,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149863929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:30,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:30,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:15:30,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149942263] [2024-10-13 06:15:30,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:30,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:15:30,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:30,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:15:30,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:15:30,516 INFO L87 Difference]: Start difference. First operand 639 states and 903 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:30,811 INFO L93 Difference]: Finished difference Result 1275 states and 1808 transitions. [2024-10-13 06:15:30,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:15:30,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-10-13 06:15:30,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:30,817 INFO L225 Difference]: With dead ends: 1275 [2024-10-13 06:15:30,817 INFO L226 Difference]: Without dead ends: 853 [2024-10-13 06:15:30,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:15:30,820 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 257 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:30,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 626 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:15:30,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-10-13 06:15:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 843. [2024-10-13 06:15:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 730 states have (on average 1.367123287671233) internal successors, (998), 730 states have internal predecessors, (998), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 06:15:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1190 transitions. [2024-10-13 06:15:30,888 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1190 transitions. Word has length 106 [2024-10-13 06:15:30,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:30,888 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1190 transitions. [2024-10-13 06:15:30,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1190 transitions. [2024-10-13 06:15:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 06:15:30,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:30,891 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:30,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:15:30,891 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:30,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:30,892 INFO L85 PathProgramCache]: Analyzing trace with hash -147010535, now seen corresponding path program 1 times [2024-10-13 06:15:30,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:30,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901520642] [2024-10-13 06:15:30,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:30,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:31,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:31,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901520642] [2024-10-13 06:15:31,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901520642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:31,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:31,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:15:31,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030991816] [2024-10-13 06:15:31,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:31,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:15:31,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:31,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:15:31,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:15:31,242 INFO L87 Difference]: Start difference. First operand 843 states and 1190 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:31,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:31,549 INFO L93 Difference]: Finished difference Result 1697 states and 2396 transitions. [2024-10-13 06:15:31,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:15:31,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-10-13 06:15:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:31,554 INFO L225 Difference]: With dead ends: 1697 [2024-10-13 06:15:31,555 INFO L226 Difference]: Without dead ends: 855 [2024-10-13 06:15:31,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:15:31,557 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 147 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:31,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 838 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:15:31,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-10-13 06:15:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 847. [2024-10-13 06:15:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 734 states have (on average 1.3651226158038148) internal successors, (1002), 734 states have internal predecessors, (1002), 96 states have call successors, (96), 16 states have call predecessors, (96), 16 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-13 06:15:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1194 transitions. [2024-10-13 06:15:31,621 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1194 transitions. Word has length 107 [2024-10-13 06:15:31,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:31,621 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1194 transitions. [2024-10-13 06:15:31,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:31,622 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1194 transitions. [2024-10-13 06:15:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 06:15:31,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:31,623 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:31,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:15:31,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:31,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:31,624 INFO L85 PathProgramCache]: Analyzing trace with hash -618907841, now seen corresponding path program 1 times [2024-10-13 06:15:31,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:31,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220306073] [2024-10-13 06:15:31,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:31,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:32,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:32,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:32,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:32,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:32,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:32,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:32,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:32,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:32,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:32,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:32,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:32,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:32,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220306073] [2024-10-13 06:15:32,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220306073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:32,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:32,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:15:32,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207896753] [2024-10-13 06:15:32,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:32,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:15:32,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:32,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:15:32,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:15:32,218 INFO L87 Difference]: Start difference. First operand 847 states and 1194 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:33,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:33,044 INFO L93 Difference]: Finished difference Result 1758 states and 2465 transitions. [2024-10-13 06:15:33,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 06:15:33,045 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-10-13 06:15:33,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:33,052 INFO L225 Difference]: With dead ends: 1758 [2024-10-13 06:15:33,053 INFO L226 Difference]: Without dead ends: 1413 [2024-10-13 06:15:33,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2024-10-13 06:15:33,055 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 379 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:33,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1328 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:15:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2024-10-13 06:15:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1054. [2024-10-13 06:15:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 913 states have (on average 1.3614457831325302) internal successors, (1243), 913 states have internal predecessors, (1243), 120 states have call successors, (120), 20 states have call predecessors, (120), 20 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-13 06:15:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1483 transitions. [2024-10-13 06:15:33,130 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1483 transitions. Word has length 107 [2024-10-13 06:15:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:33,131 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1483 transitions. [2024-10-13 06:15:33,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1483 transitions. [2024-10-13 06:15:33,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 06:15:33,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:33,134 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:33,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:15:33,134 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:33,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:33,135 INFO L85 PathProgramCache]: Analyzing trace with hash 706803623, now seen corresponding path program 1 times [2024-10-13 06:15:33,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:33,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623500636] [2024-10-13 06:15:33,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:33,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:33,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:33,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:33,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:33,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:33,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:33,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:33,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:33,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:33,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:33,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:33,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:33,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:33,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:33,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623500636] [2024-10-13 06:15:33,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623500636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:33,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:33,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:15:33,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357796893] [2024-10-13 06:15:33,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:33,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:15:33,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:33,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:15:33,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:15:33,700 INFO L87 Difference]: Start difference. First operand 1054 states and 1483 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:34,296 INFO L93 Difference]: Finished difference Result 1779 states and 2489 transitions. [2024-10-13 06:15:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:15:34,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-10-13 06:15:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:34,303 INFO L225 Difference]: With dead ends: 1779 [2024-10-13 06:15:34,303 INFO L226 Difference]: Without dead ends: 1258 [2024-10-13 06:15:34,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:15:34,306 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 236 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:34,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1393 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:15:34,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2024-10-13 06:15:34,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 947. [2024-10-13 06:15:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 820 states have (on average 1.354878048780488) internal successors, (1111), 820 states have internal predecessors, (1111), 108 states have call successors, (108), 18 states have call predecessors, (108), 18 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-13 06:15:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1327 transitions. [2024-10-13 06:15:34,371 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1327 transitions. Word has length 107 [2024-10-13 06:15:34,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:34,372 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1327 transitions. [2024-10-13 06:15:34,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:34,372 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1327 transitions. [2024-10-13 06:15:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 06:15:34,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:34,374 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:34,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:15:34,375 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:34,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash 432906706, now seen corresponding path program 1 times [2024-10-13 06:15:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:34,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104669929] [2024-10-13 06:15:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:34,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:34,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:34,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104669929] [2024-10-13 06:15:34,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104669929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:34,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:34,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:15:34,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382604004] [2024-10-13 06:15:34,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:34,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:15:34,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:34,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:15:34,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:15:34,536 INFO L87 Difference]: Start difference. First operand 947 states and 1327 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:34,598 INFO L93 Difference]: Finished difference Result 1660 states and 2321 transitions. [2024-10-13 06:15:34,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:15:34,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-10-13 06:15:34,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:34,603 INFO L225 Difference]: With dead ends: 1660 [2024-10-13 06:15:34,603 INFO L226 Difference]: Without dead ends: 698 [2024-10-13 06:15:34,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:15:34,607 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:34,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:15:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-13 06:15:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 694. [2024-10-13 06:15:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 595 states have (on average 1.3411764705882352) internal successors, (798), 595 states have internal predecessors, (798), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:15:34,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 966 transitions. [2024-10-13 06:15:34,658 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 966 transitions. Word has length 107 [2024-10-13 06:15:34,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:34,659 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 966 transitions. [2024-10-13 06:15:34,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 966 transitions. [2024-10-13 06:15:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 06:15:34,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:34,661 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:34,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:15:34,661 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:34,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:34,662 INFO L85 PathProgramCache]: Analyzing trace with hash 110425226, now seen corresponding path program 1 times [2024-10-13 06:15:34,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:34,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857344106] [2024-10-13 06:15:34,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:34,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:34,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:34,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857344106] [2024-10-13 06:15:34,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857344106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:34,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:34,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:15:34,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308587757] [2024-10-13 06:15:34,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:34,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:15:34,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:34,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:15:34,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:15:34,896 INFO L87 Difference]: Start difference. First operand 694 states and 966 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:34,980 INFO L93 Difference]: Finished difference Result 1408 states and 1959 transitions. [2024-10-13 06:15:34,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:15:34,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-10-13 06:15:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:34,985 INFO L225 Difference]: With dead ends: 1408 [2024-10-13 06:15:34,986 INFO L226 Difference]: Without dead ends: 715 [2024-10-13 06:15:34,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-13 06:15:34,989 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:34,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 554 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:15:34,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-13 06:15:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-13 06:15:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 616 states have (on average 1.3295454545454546) internal successors, (819), 616 states have internal predecessors, (819), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:15:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 987 transitions. [2024-10-13 06:15:35,059 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 987 transitions. Word has length 108 [2024-10-13 06:15:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:35,063 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 987 transitions. [2024-10-13 06:15:35,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 987 transitions. [2024-10-13 06:15:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 06:15:35,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:35,065 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:35,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:15:35,066 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:35,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:35,066 INFO L85 PathProgramCache]: Analyzing trace with hash 647236176, now seen corresponding path program 1 times [2024-10-13 06:15:35,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:35,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557387291] [2024-10-13 06:15:35,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:35,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,059 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:36,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:36,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557387291] [2024-10-13 06:15:36,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557387291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:36,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:36,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:15:36,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509896376] [2024-10-13 06:15:36,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:36,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:15:36,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:36,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:15:36,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:15:36,062 INFO L87 Difference]: Start difference. First operand 715 states and 987 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:36,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:36,374 INFO L93 Difference]: Finished difference Result 1324 states and 1821 transitions. [2024-10-13 06:15:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:15:36,375 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-10-13 06:15:36,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:36,379 INFO L225 Difference]: With dead ends: 1324 [2024-10-13 06:15:36,380 INFO L226 Difference]: Without dead ends: 828 [2024-10-13 06:15:36,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:15:36,382 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 52 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:36,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 777 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:15:36,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-10-13 06:15:36,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 739. [2024-10-13 06:15:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 640 states have (on average 1.3203125) internal successors, (845), 640 states have internal predecessors, (845), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:15:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1013 transitions. [2024-10-13 06:15:36,432 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1013 transitions. Word has length 108 [2024-10-13 06:15:36,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:36,433 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1013 transitions. [2024-10-13 06:15:36,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1013 transitions. [2024-10-13 06:15:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 06:15:36,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:36,435 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:36,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 06:15:36,435 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:36,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:36,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1281500028, now seen corresponding path program 1 times [2024-10-13 06:15:36,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:36,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214201904] [2024-10-13 06:15:36,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:36,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:36,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:36,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214201904] [2024-10-13 06:15:36,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214201904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:36,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:36,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:15:36,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765979816] [2024-10-13 06:15:36,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:36,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:15:36,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:36,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:15:36,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:36,653 INFO L87 Difference]: Start difference. First operand 739 states and 1013 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:36,821 INFO L93 Difference]: Finished difference Result 1068 states and 1467 transitions. [2024-10-13 06:15:36,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:15:36,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-10-13 06:15:36,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:36,826 INFO L225 Difference]: With dead ends: 1068 [2024-10-13 06:15:36,826 INFO L226 Difference]: Without dead ends: 548 [2024-10-13 06:15:36,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:15:36,828 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 144 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:36,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 551 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:15:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-13 06:15:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 542. [2024-10-13 06:15:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 471 states have (on average 1.3312101910828025) internal successors, (627), 471 states have internal predecessors, (627), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 06:15:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 747 transitions. [2024-10-13 06:15:36,863 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 747 transitions. Word has length 108 [2024-10-13 06:15:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:36,863 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 747 transitions. [2024-10-13 06:15:36,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 747 transitions. [2024-10-13 06:15:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 06:15:36,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:36,865 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:36,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:15:36,866 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:36,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:36,866 INFO L85 PathProgramCache]: Analyzing trace with hash 44211436, now seen corresponding path program 1 times [2024-10-13 06:15:36,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:36,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051053915] [2024-10-13 06:15:36,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:36,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:37,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:37,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051053915] [2024-10-13 06:15:37,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051053915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:37,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:37,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:15:37,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294904655] [2024-10-13 06:15:37,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:37,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:15:37,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:37,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:15:37,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:15:37,148 INFO L87 Difference]: Start difference. First operand 542 states and 747 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:37,318 INFO L93 Difference]: Finished difference Result 874 states and 1202 transitions. [2024-10-13 06:15:37,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:15:37,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-10-13 06:15:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:37,322 INFO L225 Difference]: With dead ends: 874 [2024-10-13 06:15:37,322 INFO L226 Difference]: Without dead ends: 551 [2024-10-13 06:15:37,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:15:37,323 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 136 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:37,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 551 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:15:37,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-10-13 06:15:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 542. [2024-10-13 06:15:37,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 471 states have (on average 1.326963906581741) internal successors, (625), 471 states have internal predecessors, (625), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 06:15:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 745 transitions. [2024-10-13 06:15:37,356 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 745 transitions. Word has length 108 [2024-10-13 06:15:37,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:37,357 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 745 transitions. [2024-10-13 06:15:37,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:37,357 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 745 transitions. [2024-10-13 06:15:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 06:15:37,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:37,359 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:37,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 06:15:37,359 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:37,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:37,360 INFO L85 PathProgramCache]: Analyzing trace with hash 463166862, now seen corresponding path program 1 times [2024-10-13 06:15:37,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:37,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515951386] [2024-10-13 06:15:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:37,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:37,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:37,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515951386] [2024-10-13 06:15:37,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515951386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:37,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:37,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:15:37,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757000483] [2024-10-13 06:15:37,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:37,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:15:37,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:37,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:15:37,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:15:37,824 INFO L87 Difference]: Start difference. First operand 542 states and 745 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:38,219 INFO L93 Difference]: Finished difference Result 1083 states and 1490 transitions. [2024-10-13 06:15:38,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:15:38,220 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-10-13 06:15:38,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:38,223 INFO L225 Difference]: With dead ends: 1083 [2024-10-13 06:15:38,224 INFO L226 Difference]: Without dead ends: 542 [2024-10-13 06:15:38,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:15:38,226 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 222 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:38,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 947 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:15:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-10-13 06:15:38,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 532. [2024-10-13 06:15:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 461 states have (on average 1.3253796095444685) internal successors, (611), 461 states have internal predecessors, (611), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 06:15:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 731 transitions. [2024-10-13 06:15:38,266 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 731 transitions. Word has length 109 [2024-10-13 06:15:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:38,267 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 731 transitions. [2024-10-13 06:15:38,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 731 transitions. [2024-10-13 06:15:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 06:15:38,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:38,269 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:38,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 06:15:38,269 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:38,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:38,269 INFO L85 PathProgramCache]: Analyzing trace with hash -547950388, now seen corresponding path program 1 times [2024-10-13 06:15:38,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:38,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078351489] [2024-10-13 06:15:38,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:38,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:39,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:39,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:39,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:39,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:39,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:39,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:39,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:39,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:39,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:39,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:39,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:39,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:39,181 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:39,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:39,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078351489] [2024-10-13 06:15:39,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078351489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:39,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:39,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:15:39,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16499591] [2024-10-13 06:15:39,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:39,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:15:39,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:39,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:15:39,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:15:39,187 INFO L87 Difference]: Start difference. First operand 532 states and 731 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:39,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:39,785 INFO L93 Difference]: Finished difference Result 976 states and 1332 transitions. [2024-10-13 06:15:39,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:15:39,785 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-10-13 06:15:39,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:39,789 INFO L225 Difference]: With dead ends: 976 [2024-10-13 06:15:39,789 INFO L226 Difference]: Without dead ends: 656 [2024-10-13 06:15:39,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:15:39,791 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 291 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:39,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1085 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:15:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-10-13 06:15:39,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 540. [2024-10-13 06:15:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 469 states have (on average 1.32409381663113) internal successors, (621), 469 states have internal predecessors, (621), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 06:15:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 741 transitions. [2024-10-13 06:15:39,834 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 741 transitions. Word has length 109 [2024-10-13 06:15:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:39,834 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 741 transitions. [2024-10-13 06:15:39,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 741 transitions. [2024-10-13 06:15:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 06:15:39,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:39,837 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:39,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 06:15:39,837 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:39,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:39,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1707436277, now seen corresponding path program 1 times [2024-10-13 06:15:39,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:39,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288391440] [2024-10-13 06:15:39,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:39,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:40,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:40,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288391440] [2024-10-13 06:15:40,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288391440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:40,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:40,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:15:40,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758078761] [2024-10-13 06:15:40,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:40,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:15:40,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:40,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:15:40,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:15:40,181 INFO L87 Difference]: Start difference. First operand 540 states and 741 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:40,426 INFO L93 Difference]: Finished difference Result 1087 states and 1492 transitions. [2024-10-13 06:15:40,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:15:40,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-10-13 06:15:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:40,430 INFO L225 Difference]: With dead ends: 1087 [2024-10-13 06:15:40,431 INFO L226 Difference]: Without dead ends: 548 [2024-10-13 06:15:40,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:15:40,433 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 141 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:40,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 842 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:15:40,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-13 06:15:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 538. [2024-10-13 06:15:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 467 states have (on average 1.323340471092077) internal successors, (618), 467 states have internal predecessors, (618), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 06:15:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 738 transitions. [2024-10-13 06:15:40,466 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 738 transitions. Word has length 109 [2024-10-13 06:15:40,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:40,467 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 738 transitions. [2024-10-13 06:15:40,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 738 transitions. [2024-10-13 06:15:40,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 06:15:40,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:40,469 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:40,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 06:15:40,469 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:40,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:40,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2143539272, now seen corresponding path program 1 times [2024-10-13 06:15:40,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:40,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465195769] [2024-10-13 06:15:40,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:40,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:40,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:40,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465195769] [2024-10-13 06:15:40,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465195769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:40,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:40,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:15:40,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073236860] [2024-10-13 06:15:40,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:40,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:15:40,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:40,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:15:40,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:15:40,737 INFO L87 Difference]: Start difference. First operand 538 states and 738 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:40,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:40,956 INFO L93 Difference]: Finished difference Result 870 states and 1193 transitions. [2024-10-13 06:15:40,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:15:40,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-10-13 06:15:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:40,960 INFO L225 Difference]: With dead ends: 870 [2024-10-13 06:15:40,960 INFO L226 Difference]: Without dead ends: 547 [2024-10-13 06:15:40,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:15:40,962 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 126 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:40,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 698 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:15:40,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-13 06:15:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 542. [2024-10-13 06:15:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 471 states have (on average 1.3205944798301485) internal successors, (622), 471 states have internal predecessors, (622), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 06:15:41,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 742 transitions. [2024-10-13 06:15:41,005 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 742 transitions. Word has length 109 [2024-10-13 06:15:41,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:41,006 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 742 transitions. [2024-10-13 06:15:41,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:41,006 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 742 transitions. [2024-10-13 06:15:41,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 06:15:41,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:41,008 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:41,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 06:15:41,008 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:41,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:41,008 INFO L85 PathProgramCache]: Analyzing trace with hash 5377439, now seen corresponding path program 1 times [2024-10-13 06:15:41,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:41,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611713004] [2024-10-13 06:15:41,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:41,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:41,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:15:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:41,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:15:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:41,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:15:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:41,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:15:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:41,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 06:15:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:41,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:15:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:41,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:15:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:41,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:15:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:41,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:15:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:41,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:15:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:41,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:15:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:41,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:15:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:41,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:15:41,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611713004] [2024-10-13 06:15:41,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611713004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:41,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:15:41,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201427727] [2024-10-13 06:15:41,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:41,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:15:41,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:15:41,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:15:41,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:15:41,338 INFO L87 Difference]: Start difference. First operand 542 states and 742 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:41,645 INFO L93 Difference]: Finished difference Result 1093 states and 1497 transitions. [2024-10-13 06:15:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:15:41,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-13 06:15:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:41,649 INFO L225 Difference]: With dead ends: 1093 [2024-10-13 06:15:41,649 INFO L226 Difference]: Without dead ends: 552 [2024-10-13 06:15:41,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:15:41,651 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 141 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:41,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 856 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:15:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-13 06:15:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 544. [2024-10-13 06:15:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 473 states have (on average 1.3192389006342495) internal successors, (624), 473 states have internal predecessors, (624), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 06:15:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 744 transitions. [2024-10-13 06:15:41,688 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 744 transitions. Word has length 110 [2024-10-13 06:15:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:41,689 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 744 transitions. [2024-10-13 06:15:41,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 744 transitions. [2024-10-13 06:15:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 06:15:41,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:41,691 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:41,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 06:15:41,692 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:41,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:41,693 INFO L85 PathProgramCache]: Analyzing trace with hash 122737626, now seen corresponding path program 1 times [2024-10-13 06:15:41,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:15:41,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704982688] [2024-10-13 06:15:41,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:41,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:15:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 06:15:41,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1550615045] [2024-10-13 06:15:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:41,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:15:41,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:15:41,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:15:41,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 06:15:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:15:42,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:15:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:15:42,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:15:42,420 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:15:42,421 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:15:42,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 06:15:42,623 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,SelfDestructingSolverStorable24 [2024-10-13 06:15:42,627 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:42,798 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:15:42,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:15:42 BoogieIcfgContainer [2024-10-13 06:15:42,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:15:42,803 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:15:42,803 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:15:42,803 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:15:42,804 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:15:17" (3/4) ... [2024-10-13 06:15:42,806 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:15:42,807 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:15:42,808 INFO L158 Benchmark]: Toolchain (without parser) took 26768.95ms. Allocated memory was 146.8MB in the beginning and 713.0MB in the end (delta: 566.2MB). Free memory was 74.4MB in the beginning and 350.1MB in the end (delta: -275.6MB). Peak memory consumption was 293.3MB. Max. memory is 16.1GB. [2024-10-13 06:15:42,808 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 146.8MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:15:42,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.39ms. Allocated memory is still 146.8MB. Free memory was 74.2MB in the beginning and 58.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 06:15:42,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 165.64ms. Allocated memory was 146.8MB in the beginning and 205.5MB in the end (delta: 58.7MB). Free memory was 58.7MB in the beginning and 175.0MB in the end (delta: -116.2MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-10-13 06:15:42,809 INFO L158 Benchmark]: Boogie Preprocessor took 122.88ms. Allocated memory is still 205.5MB. Free memory was 175.0MB in the beginning and 170.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:15:42,810 INFO L158 Benchmark]: RCFGBuilder took 954.69ms. Allocated memory is still 205.5MB. Free memory was 169.0MB in the beginning and 120.5MB in the end (delta: 48.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-13 06:15:42,810 INFO L158 Benchmark]: TraceAbstraction took 25127.54ms. Allocated memory was 205.5MB in the beginning and 713.0MB in the end (delta: 507.5MB). Free memory was 120.5MB in the beginning and 351.1MB in the end (delta: -230.6MB). Peak memory consumption was 276.1MB. Max. memory is 16.1GB. [2024-10-13 06:15:42,810 INFO L158 Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 713.0MB. Free memory was 351.1MB in the beginning and 350.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 06:15:42,814 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 146.8MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.39ms. Allocated memory is still 146.8MB. Free memory was 74.2MB in the beginning and 58.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 165.64ms. Allocated memory was 146.8MB in the beginning and 205.5MB in the end (delta: 58.7MB). Free memory was 58.7MB in the beginning and 175.0MB in the end (delta: -116.2MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 122.88ms. Allocated memory is still 205.5MB. Free memory was 175.0MB in the beginning and 170.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 954.69ms. Allocated memory is still 205.5MB. Free memory was 169.0MB in the beginning and 120.5MB in the end (delta: 48.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 25127.54ms. Allocated memory was 205.5MB in the beginning and 713.0MB in the end (delta: 507.5MB). Free memory was 120.5MB in the beginning and 351.1MB in the end (delta: -230.6MB). Peak memory consumption was 276.1MB. Max. memory is 16.1GB. * Witness Printer took 4.25ms. Allocated memory is still 713.0MB. Free memory was 351.1MB in the beginning and 350.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of bitwiseOr at line 99, overapproximation of bitwiseAnd at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99.25; [L22] float var_1_1 = 99.25; [L23] float* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_7 = 18477; [L24] signed short int var_1_7 = 18477; [L25] signed short int* var_1_7_Pointer = &(var_1_7); [L26] signed short int var_1_8 = 5; [L26] signed short int var_1_8 = 5; [L27] signed short int* var_1_8_Pointer = &(var_1_8); [L28] float var_1_9 = 5.8; [L28] float var_1_9 = 5.8; [L29] float* var_1_9_Pointer = &(var_1_9); [L30] float var_1_10 = 0.5; [L30] float var_1_10 = 0.5; [L31] float* var_1_10_Pointer = &(var_1_10); [L32] unsigned char var_1_11 = 16; [L32] unsigned char var_1_11 = 16; [L33] unsigned char* var_1_11_Pointer = &(var_1_11); [L34] unsigned char var_1_12 = 50; [L34] unsigned char var_1_12 = 50; [L35] unsigned char* var_1_12_Pointer = &(var_1_12); [L36] unsigned char var_1_13 = 1; [L36] unsigned char var_1_13 = 1; [L37] unsigned char* var_1_13_Pointer = &(var_1_13); [L38] unsigned long int var_1_14 = 256; [L38] unsigned long int var_1_14 = 256; [L39] unsigned long int* var_1_14_Pointer = &(var_1_14); [L40] unsigned char var_1_15 = 0; [L40] unsigned char var_1_15 = 0; [L41] unsigned char* var_1_15_Pointer = &(var_1_15); [L42] unsigned char last_1_var_1_11 = 16; [L43] unsigned long int last_1_var_1_14 = 256; [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L95] EXPR \read(var_1_11) [L95] last_1_var_1_11 = var_1_11 [L96] EXPR \read(var_1_14) [L96] last_1_var_1_14 = var_1_14 [L106] RET updateLastVariables() [L107] CALL updateVariables() [L74] var_1_7 = __VERIFIER_nondet_short() [L75] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L75] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L76] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L76] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L76] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L77] var_1_8 = __VERIFIER_nondet_short() [L78] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L79] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L79] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L79] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] var_1_9 = __VERIFIER_nondet_float() [L81] EXPR \read(var_1_9) [L81] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F [L81] EXPR \read(var_1_9) [L81] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] var_1_10 = __VERIFIER_nondet_float() [L83] EXPR \read(var_1_10) [L83] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F [L83] EXPR \read(var_1_10) [L83] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L84] var_1_12 = __VERIFIER_nondet_uchar() [L85] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] var_1_13 = __VERIFIER_nondet_uchar() [L88] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L88] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L88] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] var_1_15 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L107] RET updateVariables() [L108] CALL step() [L47] EXPR \read(*var_1_8_Pointer) [L47] signed short int stepLocal_3 = (*(var_1_8_Pointer)); [L48] unsigned long int stepLocal_2 = last_1_var_1_14; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, stepLocal_3=257, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L49] COND FALSE !(last_1_var_1_14 > stepLocal_3) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L56] EXPR \read(*var_1_11_Pointer) [L56] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L56] EXPR (*(var_1_11_Pointer)) & (*(var_1_7_Pointer)) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L56] EXPR \read(*var_1_12_Pointer) [L56] EXPR \read(*var_1_11_Pointer) [L56] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L56] COND FALSE !(((*(var_1_11_Pointer)) & (*(var_1_7_Pointer))) > (((*(var_1_12_Pointer)) * last_1_var_1_14) * ((*(var_1_11_Pointer)) + (*(var_1_11_Pointer))))) [L61] EXPR \read(*var_1_7_Pointer) [L61] (*(var_1_14_Pointer)) = (*(var_1_7_Pointer)) [L63] EXPR \read(*var_1_11_Pointer) [L63] unsigned char stepLocal_1 = (*(var_1_11_Pointer)); [L64] EXPR \read(*var_1_11_Pointer) [L64] EXPR \read(*var_1_11_Pointer) [L64] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L64] EXPR (((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))) [L64] EXPR \read(*var_1_14_Pointer) [L64] EXPR (((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L64] EXPR (*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L64] unsigned long int stepLocal_0 = (*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))); [L65] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L65] COND FALSE !(stepLocal_0 != (*(var_1_11_Pointer))) [L70] (*(var_1_1_Pointer)) = 10.5f VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR \read(*var_1_11_Pointer) [L99] EXPR \read(*var_1_11_Pointer) [L99] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR (((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))) [L99] EXPR \read(*var_1_14_Pointer) [L99] EXPR (((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR (*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR (((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f)) [L99] EXPR \read(*var_1_1_Pointer) [L99] EXPR (((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f)) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR ((((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f))) && ((last_1_var_1_14 > (*(var_1_8_Pointer))) ? ((((last_1_var_1_11 - (*(var_1_8_Pointer))) + (*(var_1_7_Pointer))) > last_1_var_1_14) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((*(var_1_12_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR ((((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f))) && ((last_1_var_1_14 > (*(var_1_8_Pointer))) ? ((((last_1_var_1_11 - (*(var_1_8_Pointer))) + (*(var_1_7_Pointer))) > last_1_var_1_14) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((*(var_1_12_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR (((((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f))) && ((last_1_var_1_14 > (*(var_1_8_Pointer))) ? ((((last_1_var_1_11 - (*(var_1_8_Pointer))) + (*(var_1_7_Pointer))) > last_1_var_1_14) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((*(var_1_12_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) : 1)) && ((((*(var_1_11_Pointer)) & (*(var_1_7_Pointer))) > (((*(var_1_12_Pointer)) * last_1_var_1_14) * ((*(var_1_11_Pointer)) + (*(var_1_11_Pointer))))) ? (((*(var_1_15_Pointer)) && ((*(var_1_9_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR (((((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f))) && ((last_1_var_1_14 > (*(var_1_8_Pointer))) ? ((((last_1_var_1_11 - (*(var_1_8_Pointer))) + (*(var_1_7_Pointer))) > last_1_var_1_14) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((*(var_1_12_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) : 1)) && ((((*(var_1_11_Pointer)) & (*(var_1_7_Pointer))) > (((*(var_1_12_Pointer)) * last_1_var_1_14) * ((*(var_1_11_Pointer)) + (*(var_1_11_Pointer))))) ? (((*(var_1_15_Pointer)) && ((*(var_1_9_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99-L100] return (((((*(var_1_11_Pointer)) ^ (((((*(var_1_11_Pointer))) > ((*(var_1_14_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_14_Pointer)))))) != (*(var_1_11_Pointer))) ? (((*(var_1_11_Pointer)) == ((*(var_1_11_Pointer)) - ((*(var_1_7_Pointer)) - (*(var_1_11_Pointer))))) ? ((*(var_1_1_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) : ((*(var_1_1_Pointer)) == ((float) 10.5f))) && ((last_1_var_1_14 > (*(var_1_8_Pointer))) ? ((((last_1_var_1_11 - (*(var_1_8_Pointer))) + (*(var_1_7_Pointer))) > last_1_var_1_14) ? ((*(var_1_11_Pointer)) == ((unsigned char) (((((*(var_1_12_Pointer))) < ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) : 1)) && ((((*(var_1_11_Pointer)) & (*(var_1_7_Pointer))) > (((*(var_1_12_Pointer)) * last_1_var_1_14) * ((*(var_1_11_Pointer)) + (*(var_1_11_Pointer))))) ? (((*(var_1_15_Pointer)) && ((*(var_1_9_Pointer)) > (*(var_1_10_Pointer)))) ? ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer)))) : 1) : ((*(var_1_14_Pointer)) == ((unsigned long int) (*(var_1_7_Pointer))))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 25, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4540 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4540 mSDsluCounter, 19075 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15259 mSDsCounter, 282 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5805 IncrementalHoareTripleChecker+Invalid, 6087 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 282 mSolverCounterUnsat, 3816 mSDtfsCounter, 5805 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1060 GetRequests, 840 SyntacticMatches, 1 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1054occurred in iteration=13, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 1107 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 2875 NumberOfCodeBlocks, 2875 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2732 ConstructedInterpolants, 0 QuantifiedInterpolants, 9588 SizeOfPredicates, 11 NumberOfNonLiveVariables, 478 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 26 InterpolantComputations, 23 PerfectInterpolantSequences, 6765/6864 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 06:15:42,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-p_file-18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8167bb57c72da66729eaf4d0bfb99f298c96636d95817c5a55fbaebfee04d766 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:15:45,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:15:45,365 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:15:45,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:15:45,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:15:45,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:15:45,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:15:45,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:15:45,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:15:45,408 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:15:45,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:15:45,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:15:45,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:15:45,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:15:45,411 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:15:45,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:15:45,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:15:45,416 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:15:45,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:15:45,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:15:45,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:15:45,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:15:45,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:15:45,418 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:15:45,418 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:15:45,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:15:45,418 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:15:45,419 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:15:45,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:15:45,419 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:15:45,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:15:45,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:15:45,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:15:45,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:15:45,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:15:45,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:15:45,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:15:45,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:15:45,424 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:15:45,424 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:15:45,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:15:45,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:15:45,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:15:45,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:15:45,425 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:15:45,426 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 -> 8167bb57c72da66729eaf4d0bfb99f298c96636d95817c5a55fbaebfee04d766 [2024-10-13 06:15:45,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:15:45,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:15:45,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:15:45,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:15:45,849 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:15:45,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-18.i [2024-10-13 06:15:47,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:15:47,793 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:15:47,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-18.i [2024-10-13 06:15:47,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b003666c8/507b2e0c910d4d28a44fe324fa149e9d/FLAG4e516ea3a [2024-10-13 06:15:48,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b003666c8/507b2e0c910d4d28a44fe324fa149e9d [2024-10-13 06:15:48,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:15:48,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:15:48,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:15:48,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:15:48,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:15:48,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:15:48" (1/1) ... [2024-10-13 06:15:48,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6114592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:48, skipping insertion in model container [2024-10-13 06:15:48,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:15:48" (1/1) ... [2024-10-13 06:15:48,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:15:48,362 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-p_file-18.i[916,929] [2024-10-13 06:15:48,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:15:48,452 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:15:48,469 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-p_file-18.i[916,929] [2024-10-13 06:15:48,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:15:48,543 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:15:48,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:48 WrapperNode [2024-10-13 06:15:48,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:15:48,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:15:48,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:15:48,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:15:48,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:48" (1/1) ... [2024-10-13 06:15:48,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:48" (1/1) ... [2024-10-13 06:15:48,626 INFO L138 Inliner]: procedures = 36, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 460 [2024-10-13 06:15:48,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:15:48,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:15:48,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:15:48,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:15:48,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:48" (1/1) ... [2024-10-13 06:15:48,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:48" (1/1) ... [2024-10-13 06:15:48,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:48" (1/1) ... [2024-10-13 06:15:48,727 INFO L175 MemorySlicer]: Split 115 memory accesses to 11 slices as follows [2, 5, 14, 8, 12, 12, 26, 12, 8, 10, 6]. 23 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 13 writes are split as follows [0, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1]. [2024-10-13 06:15:48,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:48" (1/1) ... [2024-10-13 06:15:48,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:48" (1/1) ... [2024-10-13 06:15:48,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:48" (1/1) ... [2024-10-13 06:15:48,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:48" (1/1) ... [2024-10-13 06:15:48,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:48" (1/1) ... [2024-10-13 06:15:48,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:48" (1/1) ... [2024-10-13 06:15:48,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:15:48,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:15:48,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:15:48,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:15:48,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:48" (1/1) ... [2024-10-13 06:15:48,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:15:48,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:15:48,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:15:48,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:15:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:15:48,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:15:48,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:15:48,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 06:15:48,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-13 06:15:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-13 06:15:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-13 06:15:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-13 06:15:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-13 06:15:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-13 06:15:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-13 06:15:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-13 06:15:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:15:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:15:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-13 06:15:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-13 06:15:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-13 06:15:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-13 06:15:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-13 06:15:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-13 06:15:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-13 06:15:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-13 06:15:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-13 06:15:48,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:15:48,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:15:48,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 06:15:48,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 06:15:48,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-13 06:15:48,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-13 06:15:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-13 06:15:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-13 06:15:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-13 06:15:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-13 06:15:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-13 06:15:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 06:15:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 06:15:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-13 06:15:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-13 06:15:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-13 06:15:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-13 06:15:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-13 06:15:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-13 06:15:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-13 06:15:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-13 06:15:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-10-13 06:15:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:15:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:15:48,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-13 06:15:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-13 06:15:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-13 06:15:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-13 06:15:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-13 06:15:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-13 06:15:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-13 06:15:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-13 06:15:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-13 06:15:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 06:15:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 06:15:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 06:15:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-13 06:15:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-13 06:15:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-13 06:15:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-13 06:15:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-13 06:15:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-13 06:15:48,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-13 06:15:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-10-13 06:15:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:15:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:15:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-13 06:15:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-13 06:15:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-13 06:15:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-13 06:15:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-13 06:15:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-13 06:15:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-13 06:15:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-13 06:15:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-13 06:15:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:15:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:15:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-13 06:15:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-13 06:15:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-13 06:15:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-13 06:15:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-13 06:15:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-13 06:15:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-13 06:15:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-13 06:15:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-13 06:15:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:15:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:15:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-13 06:15:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-13 06:15:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-13 06:15:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-13 06:15:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-13 06:15:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-13 06:15:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-13 06:15:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-13 06:15:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-13 06:15:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:15:48,917 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:15:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:15:48,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:15:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:15:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:15:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-13 06:15:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-13 06:15:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-13 06:15:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-13 06:15:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-13 06:15:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-13 06:15:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-13 06:15:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-13 06:15:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-13 06:15:48,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:15:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:15:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-13 06:15:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-13 06:15:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-13 06:15:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-13 06:15:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-13 06:15:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-13 06:15:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-13 06:15:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-13 06:15:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-13 06:15:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 06:15:48,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 06:15:48,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 06:15:48,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-13 06:15:48,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-13 06:15:48,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-13 06:15:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-13 06:15:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-13 06:15:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-13 06:15:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-13 06:15:48,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-10-13 06:15:49,208 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:15:49,210 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:15:50,066 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-10-13 06:15:50,067 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:15:50,124 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:15:50,124 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:15:50,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:15:50 BoogieIcfgContainer [2024-10-13 06:15:50,125 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:15:50,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:15:50,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:15:50,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:15:50,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:15:48" (1/3) ... [2024-10-13 06:15:50,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf81f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:15:50, skipping insertion in model container [2024-10-13 06:15:50,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:15:48" (2/3) ... [2024-10-13 06:15:50,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf81f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:15:50, skipping insertion in model container [2024-10-13 06:15:50,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:15:50" (3/3) ... [2024-10-13 06:15:50,136 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-18.i [2024-10-13 06:15:50,156 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:15:50,156 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:15:50,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:15:50,248 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;@15306eb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:15:50,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:15:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:15:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:15:50,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:50,266 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:50,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:50,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:50,272 INFO L85 PathProgramCache]: Analyzing trace with hash -139822009, now seen corresponding path program 1 times [2024-10-13 06:15:50,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:15:50,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139756049] [2024-10-13 06:15:50,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:50,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:15:50,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:15:50,290 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:15:50,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 06:15:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:50,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:15:50,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:15:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-13 06:15:50,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:15:50,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:15:50,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139756049] [2024-10-13 06:15:50,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139756049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:50,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:15:50,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:15:50,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061936894] [2024-10-13 06:15:50,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:50,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:15:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:15:50,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:15:50,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:15:50,783 INFO L87 Difference]: Start difference. First operand has 85 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:15:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:50,849 INFO L93 Difference]: Finished difference Result 167 states and 264 transitions. [2024-10-13 06:15:50,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:15:50,853 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-13 06:15:50,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:50,861 INFO L225 Difference]: With dead ends: 167 [2024-10-13 06:15:50,862 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 06:15:50,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:15:50,869 INFO L432 NwaCegarLoop]: 118 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, 118 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:50,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:15:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 06:15:50,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 06:15:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 69 states have internal predecessors, (98), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:15:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 122 transitions. [2024-10-13 06:15:50,922 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 122 transitions. Word has length 98 [2024-10-13 06:15:50,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:50,923 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 122 transitions. [2024-10-13 06:15:50,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:15:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 122 transitions. [2024-10-13 06:15:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:15:50,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:50,929 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:50,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 06:15:51,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:15:51,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:51,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash -191323149, now seen corresponding path program 1 times [2024-10-13 06:15:51,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:15:51,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890619198] [2024-10-13 06:15:51,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:51,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:15:51,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:15:51,136 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:15:51,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 06:15:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:51,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 06:15:51,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:15:52,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-13 06:15:52,043 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 13 treesize of output 9 [2024-10-13 06:15:52,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 06:15:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:15:52,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:15:52,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:15:52,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890619198] [2024-10-13 06:15:52,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890619198] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:15:52,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1231282614] [2024-10-13 06:15:52,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:52,414 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:15:52,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:15:52,417 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:15:52,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-13 06:15:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:53,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 06:15:53,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:15:54,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-10-13 06:15:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:15:54,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:15:54,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1231282614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:15:54,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:15:54,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-10-13 06:15:54,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135527880] [2024-10-13 06:15:54,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:15:54,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:15:54,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:15:54,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:15:54,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:15:54,166 INFO L87 Difference]: Start difference. First operand 83 states and 122 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:15:54,431 INFO L93 Difference]: Finished difference Result 249 states and 367 transitions. [2024-10-13 06:15:54,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:15:54,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-13 06:15:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:15:54,435 INFO L225 Difference]: With dead ends: 249 [2024-10-13 06:15:54,436 INFO L226 Difference]: Without dead ends: 167 [2024-10-13 06:15:54,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:15:54,439 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 70 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:15:54,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 391 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:15:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-13 06:15:54,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 162. [2024-10-13 06:15:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 135 states have (on average 1.4148148148148147) internal successors, (191), 135 states have internal predecessors, (191), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:15:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 239 transitions. [2024-10-13 06:15:54,473 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 239 transitions. Word has length 98 [2024-10-13 06:15:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:15:54,473 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 239 transitions. [2024-10-13 06:15:54,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:15:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 239 transitions. [2024-10-13 06:15:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 06:15:54,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:15:54,476 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:15:54,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-13 06:15:54,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 06:15:54,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:15:54,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:15:54,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:15:54,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1202440399, now seen corresponding path program 1 times [2024-10-13 06:15:54,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:15:54,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657109876] [2024-10-13 06:15:54,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:15:54,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:15:54,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:15:54,886 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:15:54,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 06:15:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:15:55,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 06:15:55,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:15:55,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-13 06:15:55,816 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 13 treesize of output 9 [2024-10-13 06:15:55,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-13 06:15:56,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-10-13 06:15:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:15:56,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:15:56,829 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-13 06:15:56,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-13 06:15:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-13 06:15:56,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:15:56,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657109876] [2024-10-13 06:15:56,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657109876] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:15:56,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:15:56,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-10-13 06:15:56,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982087460] [2024-10-13 06:15:56,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:15:56,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 06:15:56,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:15:56,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 06:15:56,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:15:56,919 INFO L87 Difference]: Start difference. First operand 162 states and 239 transitions. Second operand has 21 states, 19 states have (on average 4.052631578947368) internal successors, (77), 20 states have internal predecessors, (77), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-13 06:16:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:01,904 INFO L93 Difference]: Finished difference Result 638 states and 928 transitions. [2024-10-13 06:16:01,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-13 06:16:01,904 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 4.052631578947368) internal successors, (77), 20 states have internal predecessors, (77), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 98 [2024-10-13 06:16:01,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:01,908 INFO L225 Difference]: With dead ends: 638 [2024-10-13 06:16:01,908 INFO L226 Difference]: Without dead ends: 477 [2024-10-13 06:16:01,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=963, Invalid=2343, Unknown=0, NotChecked=0, Total=3306 [2024-10-13 06:16:01,914 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1265 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:01,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 1593 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 06:16:01,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-13 06:16:01,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 415. [2024-10-13 06:16:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 345 states have (on average 1.4) internal successors, (483), 345 states have internal predecessors, (483), 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-13 06:16:01,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 603 transitions. [2024-10-13 06:16:01,995 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 603 transitions. Word has length 98 [2024-10-13 06:16:01,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:01,999 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 603 transitions. [2024-10-13 06:16:01,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 4.052631578947368) internal successors, (77), 20 states have internal predecessors, (77), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-13 06:16:01,999 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 603 transitions. [2024-10-13 06:16:02,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 06:16:02,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:02,002 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:02,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 06:16:02,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:02,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:02,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:02,208 INFO L85 PathProgramCache]: Analyzing trace with hash 736813840, now seen corresponding path program 1 times [2024-10-13 06:16:02,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:02,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981631565] [2024-10-13 06:16:02,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:02,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:02,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:02,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:02,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 06:16:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:02,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 06:16:02,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:02,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-13 06:16:02,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-10-13 06:16:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:16:02,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:16:02,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:16:02,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981631565] [2024-10-13 06:16:02,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981631565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:02,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:02,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:16:02,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237238523] [2024-10-13 06:16:02,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:02,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:16:02,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:16:02,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:16:02,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:16:02,643 INFO L87 Difference]: Start difference. First operand 415 states and 603 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:16:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:03,331 INFO L93 Difference]: Finished difference Result 1016 states and 1476 transitions. [2024-10-13 06:16:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:16:03,332 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 99 [2024-10-13 06:16:03,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:03,337 INFO L225 Difference]: With dead ends: 1016 [2024-10-13 06:16:03,337 INFO L226 Difference]: Without dead ends: 602 [2024-10-13 06:16:03,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:16:03,343 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 123 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:03,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 666 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:16:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-10-13 06:16:03,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 504. [2024-10-13 06:16:03,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 421 states have (on average 1.3942992874109263) internal successors, (587), 421 states have internal predecessors, (587), 72 states have call successors, (72), 10 states have call predecessors, (72), 10 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 06:16:03,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 731 transitions. [2024-10-13 06:16:03,410 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 731 transitions. Word has length 99 [2024-10-13 06:16:03,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:03,411 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 731 transitions. [2024-10-13 06:16:03,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:16:03,411 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 731 transitions. [2024-10-13 06:16:03,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 06:16:03,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:03,413 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:03,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 06:16:03,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:03,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:03,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:03,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1129840850, now seen corresponding path program 1 times [2024-10-13 06:16:03,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:03,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806275288] [2024-10-13 06:16:03,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:03,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:03,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:03,619 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:03,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 06:16:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:03,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 06:16:03,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:04,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-13 06:16:04,053 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 13 treesize of output 9 [2024-10-13 06:16:04,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 06:16:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:16:04,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:16:04,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:16:04,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806275288] [2024-10-13 06:16:04,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806275288] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:16:04,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [230262740] [2024-10-13 06:16:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:04,267 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:16:04,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:16:04,269 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:16:04,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-13 06:16:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:04,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 06:16:04,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:05,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-10-13 06:16:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:16:05,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:16:05,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [230262740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:05,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 06:16:05,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-10-13 06:16:05,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33270898] [2024-10-13 06:16:05,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:05,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:16:05,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:16:05,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:16:05,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:16:05,511 INFO L87 Difference]: Start difference. First operand 504 states and 731 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:16:05,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:05,800 INFO L93 Difference]: Finished difference Result 1009 states and 1462 transitions. [2024-10-13 06:16:05,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:16:05,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 99 [2024-10-13 06:16:05,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:05,805 INFO L225 Difference]: With dead ends: 1009 [2024-10-13 06:16:05,805 INFO L226 Difference]: Without dead ends: 506 [2024-10-13 06:16:05,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:16:05,808 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 62 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:05,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 571 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:16:05,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-10-13 06:16:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 500. [2024-10-13 06:16:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 417 states have (on average 1.3932853717026379) internal successors, (581), 417 states have internal predecessors, (581), 72 states have call successors, (72), 10 states have call predecessors, (72), 10 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 06:16:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 725 transitions. [2024-10-13 06:16:05,863 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 725 transitions. Word has length 99 [2024-10-13 06:16:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:05,864 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 725 transitions. [2024-10-13 06:16:05,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:16:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 725 transitions. [2024-10-13 06:16:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 06:16:05,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:05,869 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:05,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-13 06:16:06,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-10-13 06:16:06,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 06:16:06,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:06,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:06,271 INFO L85 PathProgramCache]: Analyzing trace with hash 745924400, now seen corresponding path program 1 times [2024-10-13 06:16:06,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:06,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223614931] [2024-10-13 06:16:06,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:06,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:06,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:06,275 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:06,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 06:16:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:06,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 06:16:06,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:06,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-13 06:16:06,675 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 13 treesize of output 9 [2024-10-13 06:16:06,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 06:16:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:16:06,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:16:06,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:16:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223614931] [2024-10-13 06:16:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223614931] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:16:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1967279975] [2024-10-13 06:16:06,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:06,815 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:16:06,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:16:06,816 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:16:06,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-10-13 06:16:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:07,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 06:16:07,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:07,431 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 12 treesize of output 8 [2024-10-13 06:16:08,460 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 17 treesize of output 13 [2024-10-13 06:16:08,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-13 06:16:08,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 06:16:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:16:08,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:16:08,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1967279975] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:16:08,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:16:08,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-10-13 06:16:08,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63615501] [2024-10-13 06:16:08,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:16:08,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 06:16:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:16:08,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 06:16:08,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:16:08,546 INFO L87 Difference]: Start difference. First operand 500 states and 725 transitions. Second operand has 15 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-13 06:16:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:10,328 INFO L93 Difference]: Finished difference Result 946 states and 1359 transitions. [2024-10-13 06:16:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 06:16:10,329 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 99 [2024-10-13 06:16:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:10,333 INFO L225 Difference]: With dead ends: 946 [2024-10-13 06:16:10,334 INFO L226 Difference]: Without dead ends: 612 [2024-10-13 06:16:10,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 06:16:10,336 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 604 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:10,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1077 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 06:16:10,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-10-13 06:16:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 594. [2024-10-13 06:16:10,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 495 states have (on average 1.3777777777777778) internal successors, (682), 495 states have internal predecessors, (682), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:16:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 850 transitions. [2024-10-13 06:16:10,413 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 850 transitions. Word has length 99 [2024-10-13 06:16:10,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:10,414 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 850 transitions. [2024-10-13 06:16:10,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-13 06:16:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 850 transitions. [2024-10-13 06:16:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 06:16:10,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:10,416 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:10,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-13 06:16:10,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-10-13 06:16:10,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 06:16:10,817 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:10,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:10,817 INFO L85 PathProgramCache]: Analyzing trace with hash 119743797, now seen corresponding path program 1 times [2024-10-13 06:16:10,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:10,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153456104] [2024-10-13 06:16:10,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:10,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:10,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:10,821 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:10,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 06:16:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:11,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 06:16:11,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:11,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-13 06:16:11,301 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 13 treesize of output 9 [2024-10-13 06:16:11,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 06:16:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:16:11,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:16:11,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:16:11,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153456104] [2024-10-13 06:16:11,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153456104] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:16:11,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [142241494] [2024-10-13 06:16:11,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:11,488 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:16:11,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:16:11,489 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:16:11,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-10-13 06:16:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:12,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 06:16:12,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:12,114 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 12 treesize of output 8 [2024-10-13 06:16:12,966 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 17 treesize of output 13 [2024-10-13 06:16:12,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-13 06:16:13,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-13 06:16:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:16:13,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:16:13,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [142241494] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:16:13,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:16:13,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-10-13 06:16:13,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270026] [2024-10-13 06:16:13,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:16:13,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 06:16:13,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:16:13,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 06:16:13,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:16:13,061 INFO L87 Difference]: Start difference. First operand 594 states and 850 transitions. Second operand has 15 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-13 06:16:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:14,607 INFO L93 Difference]: Finished difference Result 942 states and 1338 transitions. [2024-10-13 06:16:14,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 06:16:14,608 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 100 [2024-10-13 06:16:14,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:14,615 INFO L225 Difference]: With dead ends: 942 [2024-10-13 06:16:14,615 INFO L226 Difference]: Without dead ends: 606 [2024-10-13 06:16:14,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 06:16:14,617 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 471 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:14,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 972 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 06:16:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-10-13 06:16:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 590. [2024-10-13 06:16:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 491 states have (on average 1.3686354378818737) internal successors, (672), 491 states have internal predecessors, (672), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:16:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 840 transitions. [2024-10-13 06:16:14,698 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 840 transitions. Word has length 100 [2024-10-13 06:16:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:14,700 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 840 transitions. [2024-10-13 06:16:14,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-13 06:16:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 840 transitions. [2024-10-13 06:16:14,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:16:14,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:14,702 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:14,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-13 06:16:14,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2024-10-13 06:16:15,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 06:16:15,103 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:15,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:15,104 INFO L85 PathProgramCache]: Analyzing trace with hash -153031810, now seen corresponding path program 1 times [2024-10-13 06:16:15,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:15,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101809350] [2024-10-13 06:16:15,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:15,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:15,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:15,108 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:15,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 06:16:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:15,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:16:15,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:16:15,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:16:15,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:16:15,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101809350] [2024-10-13 06:16:15,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101809350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:15,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:15,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:16:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730961955] [2024-10-13 06:16:15,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:15,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:16:15,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:16:15,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:16:15,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:16:15,389 INFO L87 Difference]: Start difference. First operand 590 states and 840 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:16:15,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:15,501 INFO L93 Difference]: Finished difference Result 1200 states and 1707 transitions. [2024-10-13 06:16:15,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:16:15,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2024-10-13 06:16:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:15,507 INFO L225 Difference]: With dead ends: 1200 [2024-10-13 06:16:15,507 INFO L226 Difference]: Without dead ends: 611 [2024-10-13 06:16:15,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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-13 06:16:15,510 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:15,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:16:15,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-10-13 06:16:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2024-10-13 06:16:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 512 states have (on average 1.353515625) internal successors, (693), 512 states have internal predecessors, (693), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:16:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 861 transitions. [2024-10-13 06:16:15,590 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 861 transitions. Word has length 101 [2024-10-13 06:16:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:15,590 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 861 transitions. [2024-10-13 06:16:15,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:16:15,591 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 861 transitions. [2024-10-13 06:16:15,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-13 06:16:15,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:15,592 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:15,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 06:16:15,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:15,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:15,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash -991465640, now seen corresponding path program 1 times [2024-10-13 06:16:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:15,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133460035] [2024-10-13 06:16:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:15,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:15,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:15,795 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:15,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 06:16:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:16,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:16:16,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:16:16,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:16:16,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:16:16,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133460035] [2024-10-13 06:16:16,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133460035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:16,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:16,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:16:16,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300215407] [2024-10-13 06:16:16,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:16,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:16:16,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:16:16,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:16:16,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:16:16,196 INFO L87 Difference]: Start difference. First operand 611 states and 861 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:16:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:16,436 INFO L93 Difference]: Finished difference Result 1219 states and 1716 transitions. [2024-10-13 06:16:16,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:16:16,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2024-10-13 06:16:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:16,440 INFO L225 Difference]: With dead ends: 1219 [2024-10-13 06:16:16,441 INFO L226 Difference]: Without dead ends: 609 [2024-10-13 06:16:16,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:16:16,443 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 65 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:16,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 381 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:16:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-10-13 06:16:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 607. [2024-10-13 06:16:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 508 states have (on average 1.3464566929133859) internal successors, (684), 508 states have internal predecessors, (684), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 06:16:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 852 transitions. [2024-10-13 06:16:16,510 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 852 transitions. Word has length 101 [2024-10-13 06:16:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:16,510 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 852 transitions. [2024-10-13 06:16:16,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:16:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 852 transitions. [2024-10-13 06:16:16,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 06:16:16,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:16,520 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:16,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 06:16:16,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:16,721 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:16,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:16,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1498675313, now seen corresponding path program 1 times [2024-10-13 06:16:16,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:16,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567006789] [2024-10-13 06:16:16,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:16,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:16,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:16,727 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:16,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 06:16:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:17,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:16:17,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:16:17,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:16:17,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:16:17,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567006789] [2024-10-13 06:16:17,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567006789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:17,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:17,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:16:17,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972732021] [2024-10-13 06:16:17,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:17,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:16:17,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:16:17,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:16:17,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:16:17,207 INFO L87 Difference]: Start difference. First operand 607 states and 852 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:16:17,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:17,489 INFO L93 Difference]: Finished difference Result 1211 states and 1698 transitions. [2024-10-13 06:16:17,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:16:17,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-13 06:16:17,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:17,494 INFO L225 Difference]: With dead ends: 1211 [2024-10-13 06:16:17,494 INFO L226 Difference]: Without dead ends: 605 [2024-10-13 06:16:17,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:16:17,496 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 58 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 414 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:17,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 414 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:16:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-10-13 06:16:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 345. [2024-10-13 06:16:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 288 states have (on average 1.3402777777777777) internal successors, (386), 288 states have internal predecessors, (386), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 06:16:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 482 transitions. [2024-10-13 06:16:17,543 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 482 transitions. Word has length 102 [2024-10-13 06:16:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:17,544 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 482 transitions. [2024-10-13 06:16:17,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:16:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 482 transitions. [2024-10-13 06:16:17,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:16:17,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:17,546 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:17,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-13 06:16:17,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:17,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:17,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:17,747 INFO L85 PathProgramCache]: Analyzing trace with hash -97526573, now seen corresponding path program 1 times [2024-10-13 06:16:17,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:17,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937016730] [2024-10-13 06:16:17,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:17,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:17,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:17,751 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:17,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 06:16:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:18,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 06:16:18,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:16:18,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:16:18,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:16:18,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937016730] [2024-10-13 06:16:18,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937016730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:18,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:18,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:16:18,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014384676] [2024-10-13 06:16:18,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:18,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:16:18,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:16:18,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:16:18,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:16:18,117 INFO L87 Difference]: Start difference. First operand 345 states and 482 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:16:18,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:18,216 INFO L93 Difference]: Finished difference Result 701 states and 979 transitions. [2024-10-13 06:16:18,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:16:18,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-13 06:16:18,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:18,220 INFO L225 Difference]: With dead ends: 701 [2024-10-13 06:16:18,220 INFO L226 Difference]: Without dead ends: 357 [2024-10-13 06:16:18,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 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-13 06:16:18,222 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:18,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:16:18,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-13 06:16:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-10-13 06:16:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 300 states have (on average 1.3266666666666667) internal successors, (398), 300 states have internal predecessors, (398), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 06:16:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 494 transitions. [2024-10-13 06:16:18,299 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 494 transitions. Word has length 103 [2024-10-13 06:16:18,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:18,301 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 494 transitions. [2024-10-13 06:16:18,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:16:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 494 transitions. [2024-10-13 06:16:18,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 06:16:18,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:18,303 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:18,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-13 06:16:18,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:18,504 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:18,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:18,505 INFO L85 PathProgramCache]: Analyzing trace with hash 439284377, now seen corresponding path program 1 times [2024-10-13 06:16:18,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:18,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470639835] [2024-10-13 06:16:18,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:18,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:18,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:18,507 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:18,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 06:16:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:18,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 06:16:18,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:18,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2024-10-13 06:16:18,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-13 06:16:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:16:18,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:16:18,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:16:18,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470639835] [2024-10-13 06:16:18,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470639835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:16:18,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:16:18,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:16:18,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861874789] [2024-10-13 06:16:18,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:16:18,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:16:18,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:16:18,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:16:18,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:16:18,998 INFO L87 Difference]: Start difference. First operand 357 states and 494 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:16:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:16:19,466 INFO L93 Difference]: Finished difference Result 799 states and 1099 transitions. [2024-10-13 06:16:19,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:16:19,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-13 06:16:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:16:19,469 INFO L225 Difference]: With dead ends: 799 [2024-10-13 06:16:19,469 INFO L226 Difference]: Without dead ends: 443 [2024-10-13 06:16:19,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:16:19,472 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 184 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:16:19,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 358 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:16:19,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-13 06:16:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 372. [2024-10-13 06:16:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 315 states have (on average 1.3111111111111111) internal successors, (413), 315 states have internal predecessors, (413), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 06:16:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 509 transitions. [2024-10-13 06:16:19,520 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 509 transitions. Word has length 103 [2024-10-13 06:16:19,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:16:19,521 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 509 transitions. [2024-10-13 06:16:19,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:16:19,521 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 509 transitions. [2024-10-13 06:16:19,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:16:19,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:16:19,522 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:16:19,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-13 06:16:19,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:19,723 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:16:19,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:16:19,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1654103771, now seen corresponding path program 1 times [2024-10-13 06:16:19,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:16:19,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849391603] [2024-10-13 06:16:19,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:16:19,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:16:19,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:16:19,726 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:16:19,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-13 06:16:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:16:20,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 06:16:20,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:16:20,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-10-13 06:16:21,017 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 14 proven. 132 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-13 06:16:21,017 INFO L311 TraceCheckSpWp]: Computing backward predicates...