./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_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 3100141cd74ca703733adb7734016958254078594930776c79e4fb9d77d186b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:41:36,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:41:36,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:41:36,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:41:36,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:41:36,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:41:36,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:41:36,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:41:36,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:41:36,665 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:41:36,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:41:36,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:41:36,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:41:36,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:41:36,666 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:41:36,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:41:36,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:41:36,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:41:36,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:41:36,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:41:36,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:41:36,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:41:36,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:41:36,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:41:36,671 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:41:36,671 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:41:36,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:41:36,672 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:41:36,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:41:36,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:41:36,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:41:36,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:41:36,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:41:36,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:41:36,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:41:36,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:41:36,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:41:36,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:41:36,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:41:36,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:41:36,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:41:36,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:41:36,676 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 -> 3100141cd74ca703733adb7734016958254078594930776c79e4fb9d77d186b8 [2024-11-16 18:41:36,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:41:36,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:41:36,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:41:36,890 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:41:36,890 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:41:36,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-18.i [2024-11-16 18:41:38,134 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:41:38,269 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:41:38,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-18.i [2024-11-16 18:41:38,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb354aa3/d396dab26b884acab0d3ffd82b39856f/FLAGd2967a75d [2024-11-16 18:41:38,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb354aa3/d396dab26b884acab0d3ffd82b39856f [2024-11-16 18:41:38,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:41:38,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:41:38,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:41:38,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:41:38,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:41:38,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:41:38" (1/1) ... [2024-11-16 18:41:38,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b146498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38, skipping insertion in model container [2024-11-16 18:41:38,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:41:38" (1/1) ... [2024-11-16 18:41:38,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:41:38,882 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-18.i[916,929] [2024-11-16 18:41:38,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:41:38,941 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:41:38,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-18.i[916,929] [2024-11-16 18:41:38,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:41:38,995 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:41:38,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38 WrapperNode [2024-11-16 18:41:38,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:41:38,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:41:38,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:41:38,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:41:39,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38" (1/1) ... [2024-11-16 18:41:39,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38" (1/1) ... [2024-11-16 18:41:39,050 INFO L138 Inliner]: procedures = 30, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 474 [2024-11-16 18:41:39,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:41:39,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:41:39,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:41:39,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:41:39,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38" (1/1) ... [2024-11-16 18:41:39,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38" (1/1) ... [2024-11-16 18:41:39,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38" (1/1) ... [2024-11-16 18:41:39,077 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-16 18:41:39,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38" (1/1) ... [2024-11-16 18:41:39,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38" (1/1) ... [2024-11-16 18:41:39,095 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38" (1/1) ... [2024-11-16 18:41:39,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38" (1/1) ... [2024-11-16 18:41:39,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38" (1/1) ... [2024-11-16 18:41:39,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38" (1/1) ... [2024-11-16 18:41:39,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:41:39,109 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:41:39,109 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:41:39,110 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:41:39,110 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38" (1/1) ... [2024-11-16 18:41:39,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:41:39,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:41:39,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:41:39,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:41:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:41:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-16 18:41:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-16 18:41:39,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-16 18:41:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 18:41:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-16 18:41:39,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 18:41:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:41:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:41:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 18:41:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:41:39,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:41:39,269 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:41:39,270 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:41:39,630 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem80#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~bitwise81#1;havoc property_#t~mem82#1;havoc property_#t~ite95#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite91#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~ite108#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite107#1;havoc property_#t~mem104#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~bitwise112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite125#1;havoc property_#t~mem118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short119#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~short126#1; [2024-11-16 18:41:39,665 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-11-16 18:41:39,665 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:41:39,686 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:41:39,686 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:41:39,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:41:39 BoogieIcfgContainer [2024-11-16 18:41:39,687 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:41:39,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:41:39,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:41:39,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:41:39,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:41:38" (1/3) ... [2024-11-16 18:41:39,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b640d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:41:39, skipping insertion in model container [2024-11-16 18:41:39,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38" (2/3) ... [2024-11-16 18:41:39,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b640d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:41:39, skipping insertion in model container [2024-11-16 18:41:39,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:41:39" (3/3) ... [2024-11-16 18:41:39,694 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-18.i [2024-11-16 18:41:39,705 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:41:39,705 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:41:39,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:41:39,759 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;@68c6a7d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:41:39,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:41:39,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:41:39,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 18:41:39,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:39,774 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-11-16 18:41:39,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:39,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:39,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1974021774, now seen corresponding path program 1 times [2024-11-16 18:41:39,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:39,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018451456] [2024-11-16 18:41:39,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:39,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:40,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:40,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:40,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:40,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:40,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:40,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:40,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:40,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:40,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:40,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:40,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:40,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:40,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018451456] [2024-11-16 18:41:40,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018451456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:40,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:40,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:41:40,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801654662] [2024-11-16 18:41:40,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:40,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:41:40,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:40,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:41:40,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:41:40,165 INFO L87 Difference]: Start difference. First operand has 111 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 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 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:41:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:40,193 INFO L93 Difference]: Finished difference Result 214 states and 331 transitions. [2024-11-16 18:41:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:41:40,195 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 109 [2024-11-16 18:41:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:40,201 INFO L225 Difference]: With dead ends: 214 [2024-11-16 18:41:40,201 INFO L226 Difference]: Without dead ends: 106 [2024-11-16 18:41:40,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:41:40,205 INFO L432 NwaCegarLoop]: 151 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, 151 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-11-16 18:41:40,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:41:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-16 18:41:40,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-16 18:41:40,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:41:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-16 18:41:40,240 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 109 [2024-11-16 18:41:40,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:40,240 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-16 18:41:40,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:41:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-16 18:41:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 18:41:40,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:40,244 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-11-16 18:41:40,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:41:40,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:40,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:40,245 INFO L85 PathProgramCache]: Analyzing trace with hash 534920696, now seen corresponding path program 1 times [2024-11-16 18:41:40,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:40,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834510705] [2024-11-16 18:41:40,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:41,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:41,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834510705] [2024-11-16 18:41:41,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834510705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:41,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:41,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:41:41,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245237392] [2024-11-16 18:41:41,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:41,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:41:41,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:41,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:41:41,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:41:41,186 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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-11-16 18:41:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:41,464 INFO L93 Difference]: Finished difference Result 312 states and 459 transitions. [2024-11-16 18:41:41,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:41:41,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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-11-16 18:41:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:41,468 INFO L225 Difference]: With dead ends: 312 [2024-11-16 18:41:41,469 INFO L226 Difference]: Without dead ends: 209 [2024-11-16 18:41:41,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:41:41,471 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 111 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:41,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 374 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:41:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-16 18:41:41,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 203. [2024-11-16 18:41:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 176 states have (on average 1.4261363636363635) internal successors, (251), 176 states have internal predecessors, (251), 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-11-16 18:41:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 299 transitions. [2024-11-16 18:41:41,506 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 299 transitions. Word has length 109 [2024-11-16 18:41:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:41,506 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 299 transitions. [2024-11-16 18:41:41,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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-11-16 18:41:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 299 transitions. [2024-11-16 18:41:41,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 18:41:41,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:41,510 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-11-16 18:41:41,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:41:41,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:41,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:41,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1026202191, now seen corresponding path program 1 times [2024-11-16 18:41:41,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:41,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348547824] [2024-11-16 18:41:41,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:41,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:41,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:41,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348547824] [2024-11-16 18:41:41,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348547824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:41,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:41,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:41:41,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640809682] [2024-11-16 18:41:41,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:41,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:41:41,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:41,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:41:41,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:41:41,715 INFO L87 Difference]: Start difference. First operand 203 states and 299 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-11-16 18:41:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:41,744 INFO L93 Difference]: Finished difference Result 308 states and 454 transitions. [2024-11-16 18:41:41,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:41:41,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-11-16 18:41:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:41,746 INFO L225 Difference]: With dead ends: 308 [2024-11-16 18:41:41,746 INFO L226 Difference]: Without dead ends: 205 [2024-11-16 18:41:41,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:41:41,748 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:41,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 424 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:41:41,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-16 18:41:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2024-11-16 18:41:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 177 states have (on average 1.423728813559322) internal successors, (252), 177 states have internal predecessors, (252), 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-11-16 18:41:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 300 transitions. [2024-11-16 18:41:41,763 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 300 transitions. Word has length 110 [2024-11-16 18:41:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:41,764 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 300 transitions. [2024-11-16 18:41:41,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-11-16 18:41:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 300 transitions. [2024-11-16 18:41:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 18:41:41,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:41,768 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-11-16 18:41:41,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:41:41,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:41,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:41,771 INFO L85 PathProgramCache]: Analyzing trace with hash 29129838, now seen corresponding path program 1 times [2024-11-16 18:41:41,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:41,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640662741] [2024-11-16 18:41:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:41,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:41,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:41,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640662741] [2024-11-16 18:41:41,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640662741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:41,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:41,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:41:41,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147548626] [2024-11-16 18:41:41,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:41,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:41:41,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:41,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:41:41,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:41:41,952 INFO L87 Difference]: Start difference. First operand 204 states and 300 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-11-16 18:41:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:41,983 INFO L93 Difference]: Finished difference Result 407 states and 601 transitions. [2024-11-16 18:41:41,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:41:41,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-11-16 18:41:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:41,985 INFO L225 Difference]: With dead ends: 407 [2024-11-16 18:41:41,985 INFO L226 Difference]: Without dead ends: 206 [2024-11-16 18:41:41,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:41:41,987 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:41,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 426 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:41:41,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-16 18:41:42,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-16 18:41:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 179 states have (on average 1.4189944134078212) internal successors, (254), 179 states have internal predecessors, (254), 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-11-16 18:41:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 302 transitions. [2024-11-16 18:41:42,006 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 302 transitions. Word has length 110 [2024-11-16 18:41:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:42,006 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 302 transitions. [2024-11-16 18:41:42,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-11-16 18:41:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 302 transitions. [2024-11-16 18:41:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 18:41:42,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:42,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-11-16 18:41:42,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:41:42,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:42,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:42,010 INFO L85 PathProgramCache]: Analyzing trace with hash -264273169, now seen corresponding path program 1 times [2024-11-16 18:41:42,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:42,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403244913] [2024-11-16 18:41:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:42,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:42,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:43,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:43,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:43,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:43,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:43,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:43,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:43,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:43,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:43,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:43,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:43,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-16 18:41:43,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:43,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403244913] [2024-11-16 18:41:43,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403244913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:41:43,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472874] [2024-11-16 18:41:43,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:43,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:41:43,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:41:43,055 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:41:43,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 18:41:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:43,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-16 18:41:43,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:41:43,419 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 19 treesize of output 1 [2024-11-16 18:41:43,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-16 18:41:43,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-16 18:41:43,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-16 18:41:43,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-16 18:41:43,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-16 18:41:43,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-16 18:41:43,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:41:43,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 34 [2024-11-16 18:41:43,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:41:43,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 46 [2024-11-16 18:41:44,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:41:44,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 56 [2024-11-16 18:41:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:41:44,074 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:41:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-16 18:41:44,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 18:41:44,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 18:41:44,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 33 [2024-11-16 18:41:44,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700170904] [2024-11-16 18:41:44,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 18:41:44,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-16 18:41:44,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:44,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-16 18:41:44,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2024-11-16 18:41:44,663 INFO L87 Difference]: Start difference. First operand 206 states and 302 transitions. Second operand has 33 states, 30 states have (on average 3.8333333333333335) internal successors, (115), 32 states have internal predecessors, (115), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-11-16 18:41:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:48,516 INFO L93 Difference]: Finished difference Result 829 states and 1200 transitions. [2024-11-16 18:41:48,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-16 18:41:48,516 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 3.8333333333333335) internal successors, (115), 32 states have internal predecessors, (115), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) Word has length 110 [2024-11-16 18:41:48,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:48,520 INFO L225 Difference]: With dead ends: 829 [2024-11-16 18:41:48,520 INFO L226 Difference]: Without dead ends: 626 [2024-11-16 18:41:48,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2449 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1451, Invalid=7479, Unknown=0, NotChecked=0, Total=8930 [2024-11-16 18:41:48,525 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 3191 mSDsluCounter, 2618 mSDsCounter, 0 mSdLazyCounter, 4636 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3191 SdHoareTripleChecker+Valid, 2829 SdHoareTripleChecker+Invalid, 4975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 4636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:48,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3191 Valid, 2829 Invalid, 4975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 4636 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-16 18:41:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-16 18:41:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 421. [2024-11-16 18:41:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 364 states have (on average 1.39010989010989) internal successors, (506), 364 states have internal predecessors, (506), 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-11-16 18:41:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 602 transitions. [2024-11-16 18:41:48,554 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 602 transitions. Word has length 110 [2024-11-16 18:41:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:48,555 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 602 transitions. [2024-11-16 18:41:48,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 3.8333333333333335) internal successors, (115), 32 states have internal predecessors, (115), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-11-16 18:41:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 602 transitions. [2024-11-16 18:41:48,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 18:41:48,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:48,557 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, 1] [2024-11-16 18:41:48,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 18:41:48,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:41:48,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:48,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:48,759 INFO L85 PathProgramCache]: Analyzing trace with hash -674749659, now seen corresponding path program 1 times [2024-11-16 18:41:48,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:48,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405135323] [2024-11-16 18:41:48,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:48,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:49,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:49,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:49,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:49,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:49,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:49,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:49,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:49,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:49,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:49,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:49,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:49,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:49,303 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:49,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:49,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405135323] [2024-11-16 18:41:49,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405135323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:49,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:49,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:41:49,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007084504] [2024-11-16 18:41:49,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:49,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:41:49,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:49,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:41:49,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:41:49,306 INFO L87 Difference]: Start difference. First operand 421 states and 602 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:50,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:50,200 INFO L93 Difference]: Finished difference Result 1083 states and 1555 transitions. [2024-11-16 18:41:50,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 18:41:50,201 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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 111 [2024-11-16 18:41:50,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:50,204 INFO L225 Difference]: With dead ends: 1083 [2024-11-16 18:41:50,204 INFO L226 Difference]: Without dead ends: 665 [2024-11-16 18:41:50,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:41:50,208 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 148 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:50,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 806 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 18:41:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-16 18:41:50,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 641. [2024-11-16 18:41:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 556 states have (on average 1.3848920863309353) internal successors, (770), 556 states have internal predecessors, (770), 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-11-16 18:41:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 914 transitions. [2024-11-16 18:41:50,238 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 914 transitions. Word has length 111 [2024-11-16 18:41:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:50,238 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 914 transitions. [2024-11-16 18:41:50,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 914 transitions. [2024-11-16 18:41:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 18:41:50,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:50,240 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, 1, 1] [2024-11-16 18:41:50,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 18:41:50,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:50,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:50,240 INFO L85 PathProgramCache]: Analyzing trace with hash 433373041, now seen corresponding path program 1 times [2024-11-16 18:41:50,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:50,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87758783] [2024-11-16 18:41:50,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:50,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:50,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:50,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:50,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:50,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:50,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:50,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:50,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:50,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:50,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:50,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:50,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:50,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:50,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:50,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87758783] [2024-11-16 18:41:50,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87758783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:50,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:50,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:41:50,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756550355] [2024-11-16 18:41:50,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:50,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:41:50,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:50,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:41:50,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:41:50,795 INFO L87 Difference]: Start difference. First operand 641 states and 914 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:51,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:51,130 INFO L93 Difference]: Finished difference Result 1277 states and 1819 transitions. [2024-11-16 18:41:51,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:41:51,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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 112 [2024-11-16 18:41:51,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:51,135 INFO L225 Difference]: With dead ends: 1277 [2024-11-16 18:41:51,135 INFO L226 Difference]: Without dead ends: 639 [2024-11-16 18:41:51,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:41:51,137 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 106 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:51,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 764 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:41:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-16 18:41:51,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 422. [2024-11-16 18:41:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 365 states have (on average 1.367123287671233) internal successors, (499), 365 states have internal predecessors, (499), 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-11-16 18:41:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 595 transitions. [2024-11-16 18:41:51,162 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 595 transitions. Word has length 112 [2024-11-16 18:41:51,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:51,162 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 595 transitions. [2024-11-16 18:41:51,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:51,163 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 595 transitions. [2024-11-16 18:41:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 18:41:51,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:51,163 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, 1, 1] [2024-11-16 18:41:51,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:41:51,165 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:51,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:51,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1754028392, now seen corresponding path program 1 times [2024-11-16 18:41:51,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:51,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304678297] [2024-11-16 18:41:51,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:51,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:51,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:51,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:51,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:51,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:51,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:51,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:51,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:51,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:51,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:51,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:51,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:51,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:51,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:51,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304678297] [2024-11-16 18:41:51,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304678297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:51,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:51,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:41:51,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211053190] [2024-11-16 18:41:51,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:51,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:41:51,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:51,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:41:51,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:41:51,324 INFO L87 Difference]: Start difference. First operand 422 states and 595 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:51,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:51,632 INFO L93 Difference]: Finished difference Result 635 states and 895 transitions. [2024-11-16 18:41:51,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:41:51,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 112 [2024-11-16 18:41:51,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:51,634 INFO L225 Difference]: With dead ends: 635 [2024-11-16 18:41:51,635 INFO L226 Difference]: Without dead ends: 419 [2024-11-16 18:41:51,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:41:51,636 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 125 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:51,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 597 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:41:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-16 18:41:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 410. [2024-11-16 18:41:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 353 states have (on average 1.3597733711048159) internal successors, (480), 353 states have internal predecessors, (480), 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-11-16 18:41:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 576 transitions. [2024-11-16 18:41:51,653 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 576 transitions. Word has length 112 [2024-11-16 18:41:51,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:51,654 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 576 transitions. [2024-11-16 18:41:51,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 576 transitions. [2024-11-16 18:41:51,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 18:41:51,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:51,655 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, 1, 1, 1] [2024-11-16 18:41:51,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 18:41:51,655 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:51,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:51,655 INFO L85 PathProgramCache]: Analyzing trace with hash 981094576, now seen corresponding path program 1 times [2024-11-16 18:41:51,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:51,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853913905] [2024-11-16 18:41:51,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:51,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:52,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:52,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:52,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:52,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:52,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:52,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:52,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:52,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:52,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:52,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:52,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:52,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:52,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:52,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853913905] [2024-11-16 18:41:52,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853913905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:52,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:52,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:41:52,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574880543] [2024-11-16 18:41:52,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:52,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:41:52,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:52,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:41:52,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:41:52,451 INFO L87 Difference]: Start difference. First operand 410 states and 576 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:53,217 INFO L93 Difference]: Finished difference Result 1085 states and 1519 transitions. [2024-11-16 18:41:53,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:41:53,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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 113 [2024-11-16 18:41:53,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:53,220 INFO L225 Difference]: With dead ends: 1085 [2024-11-16 18:41:53,220 INFO L226 Difference]: Without dead ends: 776 [2024-11-16 18:41:53,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:41:53,221 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 323 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:53,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 921 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 18:41:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-11-16 18:41:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 422. [2024-11-16 18:41:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 365 states have (on average 1.3616438356164384) internal successors, (497), 365 states have internal predecessors, (497), 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-11-16 18:41:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 593 transitions. [2024-11-16 18:41:53,244 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 593 transitions. Word has length 113 [2024-11-16 18:41:53,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:53,245 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 593 transitions. [2024-11-16 18:41:53,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 593 transitions. [2024-11-16 18:41:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 18:41:53,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:53,246 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, 1, 1, 1] [2024-11-16 18:41:53,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 18:41:53,246 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:53,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:53,246 INFO L85 PathProgramCache]: Analyzing trace with hash 283483115, now seen corresponding path program 1 times [2024-11-16 18:41:53,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:53,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887004341] [2024-11-16 18:41:53,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:53,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:53,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:53,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887004341] [2024-11-16 18:41:53,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887004341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:53,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:53,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:41:53,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353861898] [2024-11-16 18:41:53,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:53,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:41:53,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:53,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:41:53,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:41:53,375 INFO L87 Difference]: Start difference. First operand 422 states and 593 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:53,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:53,412 INFO L93 Difference]: Finished difference Result 853 states and 1199 transitions. [2024-11-16 18:41:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:41:53,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 113 [2024-11-16 18:41:53,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:53,416 INFO L225 Difference]: With dead ends: 853 [2024-11-16 18:41:53,417 INFO L226 Difference]: Without dead ends: 434 [2024-11-16 18:41:53,417 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-11-16 18:41:53,418 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:53,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:41:53,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-16 18:41:53,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2024-11-16 18:41:53,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 377 states have (on average 1.3501326259946949) internal successors, (509), 377 states have internal predecessors, (509), 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-11-16 18:41:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 605 transitions. [2024-11-16 18:41:53,438 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 605 transitions. Word has length 113 [2024-11-16 18:41:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:53,438 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 605 transitions. [2024-11-16 18:41:53,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 605 transitions. [2024-11-16 18:41:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 18:41:53,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:53,439 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, 1, 1, 1, 1] [2024-11-16 18:41:53,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 18:41:53,439 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:53,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:53,440 INFO L85 PathProgramCache]: Analyzing trace with hash -577677565, now seen corresponding path program 1 times [2024-11-16 18:41:53,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:53,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921374127] [2024-11-16 18:41:53,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:53,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:53,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921374127] [2024-11-16 18:41:53,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921374127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:53,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:53,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:41:53,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426147039] [2024-11-16 18:41:53,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:53,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:41:53,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:53,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:41:53,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:41:53,761 INFO L87 Difference]: Start difference. First operand 434 states and 605 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:54,133 INFO L93 Difference]: Finished difference Result 771 states and 1076 transitions. [2024-11-16 18:41:54,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:41:54,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 114 [2024-11-16 18:41:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:54,137 INFO L225 Difference]: With dead ends: 771 [2024-11-16 18:41:54,138 INFO L226 Difference]: Without dead ends: 541 [2024-11-16 18:41:54,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:41:54,139 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 134 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:54,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 410 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:41:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-16 18:41:54,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 426. [2024-11-16 18:41:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 369 states have (on average 1.3414634146341464) internal successors, (495), 369 states have internal predecessors, (495), 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-11-16 18:41:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 591 transitions. [2024-11-16 18:41:54,160 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 591 transitions. Word has length 114 [2024-11-16 18:41:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:54,161 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 591 transitions. [2024-11-16 18:41:54,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 591 transitions. [2024-11-16 18:41:54,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 18:41:54,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:54,162 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, 1, 1, 1, 1] [2024-11-16 18:41:54,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 18:41:54,163 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:54,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:54,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1713184959, now seen corresponding path program 1 times [2024-11-16 18:41:54,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:54,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41565963] [2024-11-16 18:41:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:54,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:54,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:54,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:54,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:54,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:54,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:54,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:54,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:54,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:54,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:54,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:54,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:54,749 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:54,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:54,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41565963] [2024-11-16 18:41:54,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41565963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:54,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:54,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:41:54,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803645645] [2024-11-16 18:41:54,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:54,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:41:54,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:54,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:41:54,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:41:54,750 INFO L87 Difference]: Start difference. First operand 426 states and 591 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:55,168 INFO L93 Difference]: Finished difference Result 973 states and 1352 transitions. [2024-11-16 18:41:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:41:55,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 114 [2024-11-16 18:41:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:55,171 INFO L225 Difference]: With dead ends: 973 [2024-11-16 18:41:55,171 INFO L226 Difference]: Without dead ends: 550 [2024-11-16 18:41:55,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:41:55,172 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 105 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:55,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 489 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:41:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-16 18:41:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 540. [2024-11-16 18:41:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 469 states have (on average 1.3411513859275053) internal successors, (629), 469 states have internal predecessors, (629), 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-11-16 18:41:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 749 transitions. [2024-11-16 18:41:55,193 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 749 transitions. Word has length 114 [2024-11-16 18:41:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:55,193 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 749 transitions. [2024-11-16 18:41:55,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 749 transitions. [2024-11-16 18:41:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 18:41:55,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:55,194 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, 1, 1, 1, 1] [2024-11-16 18:41:55,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 18:41:55,194 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:55,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2076223712, now seen corresponding path program 1 times [2024-11-16 18:41:55,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:55,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514815121] [2024-11-16 18:41:55,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:55,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:55,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:55,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:55,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:55,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:55,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:55,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:55,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:55,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:55,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:55,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:55,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:55,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:55,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:55,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514815121] [2024-11-16 18:41:55,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514815121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:55,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:55,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:41:55,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408677467] [2024-11-16 18:41:55,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:55,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:41:55,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:55,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:41:55,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:41:55,443 INFO L87 Difference]: Start difference. First operand 540 states and 749 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:56,052 INFO L93 Difference]: Finished difference Result 1703 states and 2367 transitions. [2024-11-16 18:41:56,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 18:41:56,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 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 114 [2024-11-16 18:41:56,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:56,056 INFO L225 Difference]: With dead ends: 1703 [2024-11-16 18:41:56,056 INFO L226 Difference]: Without dead ends: 1278 [2024-11-16 18:41:56,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:41:56,058 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 334 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:56,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 798 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:41:56,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2024-11-16 18:41:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 985. [2024-11-16 18:41:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 858 states have (on average 1.3508158508158508) internal successors, (1159), 858 states have internal predecessors, (1159), 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-11-16 18:41:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1375 transitions. [2024-11-16 18:41:56,098 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1375 transitions. Word has length 114 [2024-11-16 18:41:56,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:56,098 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1375 transitions. [2024-11-16 18:41:56,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:56,099 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1375 transitions. [2024-11-16 18:41:56,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 18:41:56,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:56,100 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, 1, 1, 1, 1, 1] [2024-11-16 18:41:56,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 18:41:56,100 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:56,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:56,100 INFO L85 PathProgramCache]: Analyzing trace with hash 468296010, now seen corresponding path program 1 times [2024-11-16 18:41:56,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:56,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526520791] [2024-11-16 18:41:56,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:56,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:56,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:56,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:56,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:56,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:56,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:56,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:56,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:56,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:56,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:56,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:56,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:56,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:56,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:56,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526520791] [2024-11-16 18:41:56,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526520791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:56,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:56,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:41:56,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793897614] [2024-11-16 18:41:56,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:56,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:41:56,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:56,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:41:56,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:41:56,485 INFO L87 Difference]: Start difference. First operand 985 states and 1375 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:57,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:57,135 INFO L93 Difference]: Finished difference Result 2297 states and 3193 transitions. [2024-11-16 18:41:57,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:41:57,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 115 [2024-11-16 18:41:57,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:57,141 INFO L225 Difference]: With dead ends: 2297 [2024-11-16 18:41:57,141 INFO L226 Difference]: Without dead ends: 1431 [2024-11-16 18:41:57,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:41:57,143 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 323 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:57,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 810 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:41:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2024-11-16 18:41:57,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1095. [2024-11-16 18:41:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 954 states have (on average 1.349056603773585) internal successors, (1287), 954 states have internal predecessors, (1287), 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-11-16 18:41:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1527 transitions. [2024-11-16 18:41:57,188 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1527 transitions. Word has length 115 [2024-11-16 18:41:57,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:57,189 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1527 transitions. [2024-11-16 18:41:57,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1527 transitions. [2024-11-16 18:41:57,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 18:41:57,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:57,190 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, 1, 1, 1, 1, 1] [2024-11-16 18:41:57,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 18:41:57,190 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:57,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:57,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1212591342, now seen corresponding path program 1 times [2024-11-16 18:41:57,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:57,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753589637] [2024-11-16 18:41:57,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:57,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:57,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:57,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:57,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:57,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:57,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:57,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:57,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:57,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:57,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:57,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:57,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:57,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:57,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:57,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753589637] [2024-11-16 18:41:57,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753589637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:57,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:57,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:41:57,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219391273] [2024-11-16 18:41:57,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:57,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:41:57,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:57,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:41:57,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:41:57,725 INFO L87 Difference]: Start difference. First operand 1095 states and 1527 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:57,953 INFO L93 Difference]: Finished difference Result 2515 states and 3510 transitions. [2024-11-16 18:41:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:41:57,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 115 [2024-11-16 18:41:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:57,958 INFO L225 Difference]: With dead ends: 2515 [2024-11-16 18:41:57,958 INFO L226 Difference]: Without dead ends: 1423 [2024-11-16 18:41:57,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:41:57,961 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 99 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:57,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 513 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:41:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2024-11-16 18:41:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1417. [2024-11-16 18:41:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1234 states have (on average 1.347649918962723) internal successors, (1663), 1234 states have internal predecessors, (1663), 156 states have call successors, (156), 26 states have call predecessors, (156), 26 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-16 18:41:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1975 transitions. [2024-11-16 18:41:58,019 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1975 transitions. Word has length 115 [2024-11-16 18:41:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:58,020 INFO L471 AbstractCegarLoop]: Abstraction has 1417 states and 1975 transitions. [2024-11-16 18:41:58,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1975 transitions. [2024-11-16 18:41:58,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 18:41:58,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:58,021 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, 1, 1, 1, 1, 1] [2024-11-16 18:41:58,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 18:41:58,021 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:58,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:58,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1429782312, now seen corresponding path program 1 times [2024-11-16 18:41:58,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:58,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307091223] [2024-11-16 18:41:58,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:58,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:58,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:58,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:58,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:58,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:58,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:58,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:58,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:58,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:58,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:58,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:58,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:58,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:58,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307091223] [2024-11-16 18:41:58,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307091223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:58,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:58,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:41:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889268651] [2024-11-16 18:41:58,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:58,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:41:58,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:58,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:41:58,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:41:58,544 INFO L87 Difference]: Start difference. First operand 1417 states and 1975 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:58,988 INFO L93 Difference]: Finished difference Result 2589 states and 3600 transitions. [2024-11-16 18:41:58,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:41:58,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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 115 [2024-11-16 18:41:58,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:58,995 INFO L225 Difference]: With dead ends: 2589 [2024-11-16 18:41:58,995 INFO L226 Difference]: Without dead ends: 1522 [2024-11-16 18:41:58,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:41:58,997 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 46 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:58,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 558 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:41:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2024-11-16 18:41:59,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1435. [2024-11-16 18:41:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1252 states have (on average 1.3426517571884984) internal successors, (1681), 1252 states have internal predecessors, (1681), 156 states have call successors, (156), 26 states have call predecessors, (156), 26 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-16 18:41:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1993 transitions. [2024-11-16 18:41:59,063 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1993 transitions. Word has length 115 [2024-11-16 18:41:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:59,063 INFO L471 AbstractCegarLoop]: Abstraction has 1435 states and 1993 transitions. [2024-11-16 18:41:59,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:59,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1993 transitions. [2024-11-16 18:41:59,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 18:41:59,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:59,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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:41:59,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 18:41:59,066 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:59,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1516769012, now seen corresponding path program 1 times [2024-11-16 18:41:59,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:59,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453653208] [2024-11-16 18:41:59,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:59,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:59,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:41:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:59,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:41:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:59,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:41:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:59,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:41:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:59,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:41:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:59,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:41:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:59,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:41:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:59,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:41:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:59,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:41:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:59,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:41:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:59,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:41:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:59,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:41:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:41:59,198 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:41:59,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:41:59,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453653208] [2024-11-16 18:41:59,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453653208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:41:59,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:41:59,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:41:59,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904171597] [2024-11-16 18:41:59,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:41:59,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:41:59,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:41:59,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:41:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:41:59,200 INFO L87 Difference]: Start difference. First operand 1435 states and 1993 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:59,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:41:59,261 INFO L93 Difference]: Finished difference Result 2906 states and 4035 transitions. [2024-11-16 18:41:59,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:41:59,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 115 [2024-11-16 18:41:59,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:41:59,266 INFO L225 Difference]: With dead ends: 2906 [2024-11-16 18:41:59,266 INFO L226 Difference]: Without dead ends: 1474 [2024-11-16 18:41:59,268 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-11-16 18:41:59,269 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:41:59,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:41:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2024-11-16 18:41:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2024-11-16 18:41:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1291 states have (on average 1.332300542215337) internal successors, (1720), 1291 states have internal predecessors, (1720), 156 states have call successors, (156), 26 states have call predecessors, (156), 26 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-16 18:41:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2032 transitions. [2024-11-16 18:41:59,323 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2032 transitions. Word has length 115 [2024-11-16 18:41:59,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:41:59,323 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 2032 transitions. [2024-11-16 18:41:59,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:41:59,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2032 transitions. [2024-11-16 18:41:59,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 18:41:59,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:41:59,325 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, 1, 1, 1, 1, 1] [2024-11-16 18:41:59,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 18:41:59,325 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:41:59,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:41:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1282470587, now seen corresponding path program 1 times [2024-11-16 18:41:59,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:41:59,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785420929] [2024-11-16 18:41:59,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:41:59,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:41:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:42:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:00,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:42:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:00,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:42:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:00,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:42:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:00,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:42:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:00,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:42:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:00,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:42:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:00,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:42:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:00,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:42:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:00,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:42:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:00,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:42:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:00,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:42:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:00,101 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:00,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:42:00,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785420929] [2024-11-16 18:42:00,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785420929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:00,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:00,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:42:00,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538241090] [2024-11-16 18:42:00,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:00,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:42:00,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:42:00,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:42:00,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:42:00,103 INFO L87 Difference]: Start difference. First operand 1474 states and 2032 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:00,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:00,872 INFO L93 Difference]: Finished difference Result 2652 states and 3651 transitions. [2024-11-16 18:42:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:42:00,873 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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 115 [2024-11-16 18:42:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:00,878 INFO L225 Difference]: With dead ends: 2652 [2024-11-16 18:42:00,879 INFO L226 Difference]: Without dead ends: 1637 [2024-11-16 18:42:00,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2024-11-16 18:42:00,881 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 349 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:00,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 489 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 18:42:00,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2024-11-16 18:42:00,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1145. [2024-11-16 18:42:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1004 states have (on average 1.3306772908366533) internal successors, (1336), 1004 states have internal predecessors, (1336), 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-11-16 18:42:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1576 transitions. [2024-11-16 18:42:00,934 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1576 transitions. Word has length 115 [2024-11-16 18:42:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:00,934 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1576 transitions. [2024-11-16 18:42:00,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1576 transitions. [2024-11-16 18:42:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-16 18:42:00,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:00,935 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, 1, 1, 1, 1, 1, 1] [2024-11-16 18:42:00,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 18:42:00,936 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:00,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:00,936 INFO L85 PathProgramCache]: Analyzing trace with hash 251620384, now seen corresponding path program 1 times [2024-11-16 18:42:00,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:42:00,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129702272] [2024-11-16 18:42:00,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:00,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:42:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:01,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:42:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:01,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:42:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:01,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:42:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:01,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:42:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:01,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:42:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:01,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:42:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:01,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:42:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:01,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:42:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:01,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:42:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:01,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:42:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:01,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:42:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:01,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:42:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:01,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:42:01,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129702272] [2024-11-16 18:42:01,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129702272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:01,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:01,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:42:01,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21292839] [2024-11-16 18:42:01,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:01,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:42:01,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:42:01,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:42:01,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:42:01,343 INFO L87 Difference]: Start difference. First operand 1145 states and 1576 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:42:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:01,787 INFO L93 Difference]: Finished difference Result 1950 states and 2682 transitions. [2024-11-16 18:42:01,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:42:01,788 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 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 116 [2024-11-16 18:42:01,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:01,791 INFO L225 Difference]: With dead ends: 1950 [2024-11-16 18:42:01,792 INFO L226 Difference]: Without dead ends: 1164 [2024-11-16 18:42:01,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:42:01,793 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 125 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:01,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 526 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:42:01,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2024-11-16 18:42:01,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1151. [2024-11-16 18:42:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1010 states have (on average 1.3287128712871288) internal successors, (1342), 1010 states have internal predecessors, (1342), 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-11-16 18:42:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1582 transitions. [2024-11-16 18:42:01,843 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1582 transitions. Word has length 116 [2024-11-16 18:42:01,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:01,843 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1582 transitions. [2024-11-16 18:42:01,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:42:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1582 transitions. [2024-11-16 18:42:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-16 18:42:01,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:01,845 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, 1, 1, 1, 1, 1, 1] [2024-11-16 18:42:01,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 18:42:01,845 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:01,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1870478659, now seen corresponding path program 1 times [2024-11-16 18:42:01,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:42:01,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513734537] [2024-11-16 18:42:01,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:42:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:42:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:42:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:42:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:42:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:42:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:42:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:42:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:42:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:42:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:42:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:42:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:42:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:02,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:42:02,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513734537] [2024-11-16 18:42:02,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513734537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:02,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:02,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:42:02,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394744078] [2024-11-16 18:42:02,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:02,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:42:02,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:42:02,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:42:02,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:42:02,099 INFO L87 Difference]: Start difference. First operand 1151 states and 1582 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:02,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:02,437 INFO L93 Difference]: Finished difference Result 2308 states and 3173 transitions. [2024-11-16 18:42:02,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:42:02,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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 116 [2024-11-16 18:42:02,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:02,442 INFO L225 Difference]: With dead ends: 2308 [2024-11-16 18:42:02,442 INFO L226 Difference]: Without dead ends: 1160 [2024-11-16 18:42:02,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:42:02,444 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 125 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:02,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 505 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:42:02,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2024-11-16 18:42:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 793. [2024-11-16 18:42:02,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 694 states have (on average 1.3227665706051874) internal successors, (918), 694 states have internal predecessors, (918), 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-11-16 18:42:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1086 transitions. [2024-11-16 18:42:02,487 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1086 transitions. Word has length 116 [2024-11-16 18:42:02,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:02,487 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1086 transitions. [2024-11-16 18:42:02,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1086 transitions. [2024-11-16 18:42:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-16 18:42:02,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:02,489 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, 1, 1, 1, 1, 1, 1] [2024-11-16 18:42:02,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 18:42:02,489 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:02,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:02,489 INFO L85 PathProgramCache]: Analyzing trace with hash 132057279, now seen corresponding path program 1 times [2024-11-16 18:42:02,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:42:02,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180420649] [2024-11-16 18:42:02,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:02,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:42:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:42:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:42:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:42:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:42:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:42:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:42:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:42:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:42:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:42:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:42:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:42:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:42:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:02,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:42:02,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180420649] [2024-11-16 18:42:02,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180420649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:02,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:02,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:42:02,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895669006] [2024-11-16 18:42:02,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:02,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:42:02,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:42:02,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:42:02,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:42:02,866 INFO L87 Difference]: Start difference. First operand 793 states and 1086 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:03,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:03,050 INFO L93 Difference]: Finished difference Result 1578 states and 2160 transitions. [2024-11-16 18:42:03,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:42:03,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 116 [2024-11-16 18:42:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:03,055 INFO L225 Difference]: With dead ends: 1578 [2024-11-16 18:42:03,055 INFO L226 Difference]: Without dead ends: 788 [2024-11-16 18:42:03,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:42:03,057 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 92 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:03,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 378 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:42:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-11-16 18:42:03,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 785. [2024-11-16 18:42:03,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 686 states have (on average 1.3192419825072885) internal successors, (905), 686 states have internal predecessors, (905), 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-11-16 18:42:03,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1073 transitions. [2024-11-16 18:42:03,094 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1073 transitions. Word has length 116 [2024-11-16 18:42:03,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:03,094 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1073 transitions. [2024-11-16 18:42:03,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:03,094 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1073 transitions. [2024-11-16 18:42:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-16 18:42:03,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:03,095 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, 1, 1, 1, 1, 1, 1] [2024-11-16 18:42:03,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 18:42:03,096 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:03,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:03,096 INFO L85 PathProgramCache]: Analyzing trace with hash 603743738, now seen corresponding path program 1 times [2024-11-16 18:42:03,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:42:03,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866843883] [2024-11-16 18:42:03,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:03,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:42:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:03,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:42:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:03,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:42:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:03,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:42:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:03,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:42:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:03,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:42:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:03,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:42:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:03,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:42:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:03,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:42:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:03,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:42:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:03,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:42:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:03,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:42:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:03,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:42:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:03,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:42:03,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866843883] [2024-11-16 18:42:03,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866843883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:03,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:03,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:42:03,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980657625] [2024-11-16 18:42:03,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:03,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:42:03,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:42:03,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:42:03,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:42:03,822 INFO L87 Difference]: Start difference. First operand 785 states and 1073 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:04,399 INFO L93 Difference]: Finished difference Result 1598 states and 2180 transitions. [2024-11-16 18:42:04,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:42:04,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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 116 [2024-11-16 18:42:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:04,403 INFO L225 Difference]: With dead ends: 1598 [2024-11-16 18:42:04,403 INFO L226 Difference]: Without dead ends: 1141 [2024-11-16 18:42:04,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:42:04,405 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 186 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:04,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 781 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:42:04,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2024-11-16 18:42:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1009. [2024-11-16 18:42:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 882 states have (on average 1.31859410430839) internal successors, (1163), 882 states have internal predecessors, (1163), 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-11-16 18:42:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1379 transitions. [2024-11-16 18:42:04,452 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1379 transitions. Word has length 116 [2024-11-16 18:42:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:04,453 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1379 transitions. [2024-11-16 18:42:04,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1379 transitions. [2024-11-16 18:42:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:42:04,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:04,454 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:42:04,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 18:42:04,454 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:04,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:04,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1062914499, now seen corresponding path program 1 times [2024-11-16 18:42:04,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:42:04,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451696150] [2024-11-16 18:42:04,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:04,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:42:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:04,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:42:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:04,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:42:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:04,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:42:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:04,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:42:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:04,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:42:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:04,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:42:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:04,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:42:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:04,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:42:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:04,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:42:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:04,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:42:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:04,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:42:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:04,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:42:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:04,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:42:04,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451696150] [2024-11-16 18:42:04,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451696150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:04,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:04,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:42:04,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107091306] [2024-11-16 18:42:04,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:04,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:42:04,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:42:04,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:42:04,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:42:04,814 INFO L87 Difference]: Start difference. First operand 1009 states and 1379 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:05,352 INFO L93 Difference]: Finished difference Result 1584 states and 2151 transitions. [2024-11-16 18:42:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:42:05,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (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 117 [2024-11-16 18:42:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:05,357 INFO L225 Difference]: With dead ends: 1584 [2024-11-16 18:42:05,357 INFO L226 Difference]: Without dead ends: 1127 [2024-11-16 18:42:05,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:42:05,358 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 80 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:05,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 770 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:42:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2024-11-16 18:42:05,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 660. [2024-11-16 18:42:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 575 states have (on average 1.3113043478260868) internal successors, (754), 575 states have internal predecessors, (754), 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-11-16 18:42:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 898 transitions. [2024-11-16 18:42:05,399 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 898 transitions. Word has length 117 [2024-11-16 18:42:05,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:05,399 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 898 transitions. [2024-11-16 18:42:05,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 898 transitions. [2024-11-16 18:42:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:42:05,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:05,401 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:42:05,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 18:42:05,401 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:05,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:05,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1869462694, now seen corresponding path program 1 times [2024-11-16 18:42:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:42:05,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199154897] [2024-11-16 18:42:05,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:05,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:42:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:05,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:42:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:05,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:42:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:05,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:42:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:05,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:42:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:05,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:42:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:05,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:42:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:05,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:42:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:05,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:42:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:05,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:42:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:05,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:42:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:05,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:42:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:05,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:42:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:05,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:42:05,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199154897] [2024-11-16 18:42:05,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199154897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:05,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:05,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:42:05,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746203799] [2024-11-16 18:42:05,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:05,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:42:05,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:42:05,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:42:05,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:42:05,855 INFO L87 Difference]: Start difference. First operand 660 states and 898 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:06,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:06,246 INFO L93 Difference]: Finished difference Result 1093 states and 1481 transitions. [2024-11-16 18:42:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:42:06,247 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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 117 [2024-11-16 18:42:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:06,249 INFO L225 Difference]: With dead ends: 1093 [2024-11-16 18:42:06,249 INFO L226 Difference]: Without dead ends: 762 [2024-11-16 18:42:06,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:42:06,250 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 74 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:06,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 605 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:42:06,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-16 18:42:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 666. [2024-11-16 18:42:06,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 581 states have (on average 1.3080895008605853) internal successors, (760), 581 states have internal predecessors, (760), 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-11-16 18:42:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 904 transitions. [2024-11-16 18:42:06,278 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 904 transitions. Word has length 117 [2024-11-16 18:42:06,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:06,278 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 904 transitions. [2024-11-16 18:42:06,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 904 transitions. [2024-11-16 18:42:06,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:42:06,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:06,280 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:42:06,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 18:42:06,280 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:06,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:06,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1482178510, now seen corresponding path program 1 times [2024-11-16 18:42:06,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:42:06,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137426812] [2024-11-16 18:42:06,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:06,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:42:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:06,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:42:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:06,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:42:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:06,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:42:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:06,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:42:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:06,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:42:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:06,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:42:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:06,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:42:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:06,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:42:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:06,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:42:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:06,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:42:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:06,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:42:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:06,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:42:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:06,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:42:06,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137426812] [2024-11-16 18:42:06,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137426812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:06,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:06,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:42:06,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415645731] [2024-11-16 18:42:06,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:06,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:42:06,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:42:06,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:42:06,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:42:06,639 INFO L87 Difference]: Start difference. First operand 666 states and 904 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:07,011 INFO L93 Difference]: Finished difference Result 1904 states and 2570 transitions. [2024-11-16 18:42:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 18:42:07,012 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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 117 [2024-11-16 18:42:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:07,015 INFO L225 Difference]: With dead ends: 1904 [2024-11-16 18:42:07,015 INFO L226 Difference]: Without dead ends: 1241 [2024-11-16 18:42:07,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:42:07,017 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 117 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:07,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1052 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:42:07,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2024-11-16 18:42:07,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1214. [2024-11-16 18:42:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1081 states have (on average 1.314523589269195) internal successors, (1421), 1087 states have internal predecessors, (1421), 108 states have call successors, (108), 24 states have call predecessors, (108), 24 states have return successors, (108), 102 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-16 18:42:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1637 transitions. [2024-11-16 18:42:07,064 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1637 transitions. Word has length 117 [2024-11-16 18:42:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:07,064 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1637 transitions. [2024-11-16 18:42:07,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1637 transitions. [2024-11-16 18:42:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:42:07,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:07,066 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:42:07,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 18:42:07,066 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:07,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:07,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1070504128, now seen corresponding path program 1 times [2024-11-16 18:42:07,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:42:07,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654916680] [2024-11-16 18:42:07,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:07,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:42:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:07,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:42:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:07,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:42:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:07,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:42:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:07,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:42:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:07,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:42:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:07,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:42:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:07,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:42:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:07,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:42:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:07,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:42:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:07,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:42:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:07,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:42:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:07,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:42:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:07,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:42:07,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654916680] [2024-11-16 18:42:07,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654916680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:07,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:07,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:42:07,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276869875] [2024-11-16 18:42:07,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:07,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:42:07,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:42:07,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:42:07,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:42:07,704 INFO L87 Difference]: Start difference. First operand 1214 states and 1637 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:08,205 INFO L93 Difference]: Finished difference Result 2064 states and 2788 transitions. [2024-11-16 18:42:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:42:08,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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 117 [2024-11-16 18:42:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:08,211 INFO L225 Difference]: With dead ends: 2064 [2024-11-16 18:42:08,211 INFO L226 Difference]: Without dead ends: 1449 [2024-11-16 18:42:08,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:42:08,213 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 127 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:08,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 614 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:42:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2024-11-16 18:42:08,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1438. [2024-11-16 18:42:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1277 states have (on average 1.3140172278778386) internal successors, (1678), 1283 states have internal predecessors, (1678), 132 states have call successors, (132), 28 states have call predecessors, (132), 28 states have return successors, (132), 126 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-16 18:42:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1942 transitions. [2024-11-16 18:42:08,277 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1942 transitions. Word has length 117 [2024-11-16 18:42:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:08,277 INFO L471 AbstractCegarLoop]: Abstraction has 1438 states and 1942 transitions. [2024-11-16 18:42:08,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1942 transitions. [2024-11-16 18:42:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 18:42:08,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:08,278 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:42:08,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 18:42:08,279 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:08,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:08,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1581038305, now seen corresponding path program 1 times [2024-11-16 18:42:08,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:42:08,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143921451] [2024-11-16 18:42:08,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:08,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:42:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:42:08,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1050573279] [2024-11-16 18:42:08,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:08,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:42:08,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:42:08,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:42:08,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 18:42:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:42:08,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:42:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:42:08,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:42:08,864 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:42:08,865 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:42:08,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 18:42:09,067 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,SelfDestructingSolverStorable26 [2024-11-16 18:42:09,070 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, 1, 1] [2024-11-16 18:42:09,109 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:42:09,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:42:09 BoogieIcfgContainer [2024-11-16 18:42:09,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:42:09,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:42:09,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:42:09,115 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:42:09,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:41:39" (3/4) ... [2024-11-16 18:42:09,117 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:42:09,118 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:42:09,119 INFO L158 Benchmark]: Toolchain (without parser) took 30436.05ms. Allocated memory was 130.0MB in the beginning and 960.5MB in the end (delta: 830.5MB). Free memory was 60.9MB in the beginning and 533.6MB in the end (delta: -472.7MB). Peak memory consumption was 361.7MB. Max. memory is 16.1GB. [2024-11-16 18:42:09,119 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:42:09,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.39ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 60.7MB in the beginning and 132.5MB in the end (delta: -71.8MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-16 18:42:09,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.75ms. Allocated memory is still 169.9MB. Free memory was 132.5MB in the beginning and 128.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:42:09,122 INFO L158 Benchmark]: Boogie Preprocessor took 57.44ms. Allocated memory is still 169.9MB. Free memory was 128.3MB in the beginning and 125.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:42:09,122 INFO L158 Benchmark]: IcfgBuilder took 577.35ms. Allocated memory is still 169.9MB. Free memory was 125.0MB in the beginning and 86.3MB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-16 18:42:09,122 INFO L158 Benchmark]: TraceAbstraction took 29424.53ms. Allocated memory was 169.9MB in the beginning and 960.5MB in the end (delta: 790.6MB). Free memory was 85.3MB in the beginning and 533.6MB in the end (delta: -448.3MB). Peak memory consumption was 344.4MB. Max. memory is 16.1GB. [2024-11-16 18:42:09,122 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 960.5MB. Free memory is still 533.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:42:09,122 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.39ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 60.7MB in the beginning and 132.5MB in the end (delta: -71.8MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.75ms. Allocated memory is still 169.9MB. Free memory was 132.5MB in the beginning and 128.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.44ms. Allocated memory is still 169.9MB. Free memory was 128.3MB in the beginning and 125.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 577.35ms. Allocated memory is still 169.9MB. Free memory was 125.0MB in the beginning and 86.3MB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 29424.53ms. Allocated memory was 169.9MB in the beginning and 960.5MB in the end (delta: 790.6MB). Free memory was 85.3MB in the beginning and 533.6MB in the end (delta: -448.3MB). Peak memory consumption was 344.4MB. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 960.5MB. Free memory is still 533.6MB. There was no memory consumed. 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 104, overapproximation of bitwiseOr at line 104, overapproximation of bitwiseAnd at line 61. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 99.25, 18477, 5, 5.8, 0.5, 16, 50, 1, 256, 0 }; [L47] unsigned char last_1_WrapperStruct00_var_1_11 = 16; [L48] unsigned long int last_1_WrapperStruct00_var_1_14 = 256; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L100] EXPR WrapperStruct00.var_1_11 [L100] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L101] EXPR WrapperStruct00.var_1_14 [L101] last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L79] WrapperStruct00.var_1_7 = __VERIFIER_nondet_short() [L80] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L80] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L80] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L81] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L81] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L81] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L82] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L83] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L84] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L85] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L86] EXPR WrapperStruct00.var_1_9 [L86] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L86] EXPR WrapperStruct00.var_1_9 [L86] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L86] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L86] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L86] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L87] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L88] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L89] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L91] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L92] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L94] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L95] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L97] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L112] RET updateVariables() [L113] CALL step() [L52] EXPR WrapperStruct00.var_1_8 [L52] signed short int stepLocal_3 = WrapperStruct00.var_1_8; [L53] unsigned long int stepLocal_2 = last_1_WrapperStruct00_var_1_14; VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256, stepLocal_2=256, stepLocal_3=257] [L54] COND FALSE !(last_1_WrapperStruct00_var_1_14 > stepLocal_3) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256, stepLocal_2=256] [L61] EXPR WrapperStruct00.var_1_11 [L61] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256, stepLocal_2=256] [L61] EXPR WrapperStruct00.var_1_11 & WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256, stepLocal_2=256] [L61] EXPR WrapperStruct00.var_1_12 [L61] EXPR WrapperStruct00.var_1_11 [L61] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256, stepLocal_2=256] [L61] COND FALSE !((WrapperStruct00.var_1_11 & WrapperStruct00.var_1_7) > ((WrapperStruct00.var_1_12 * last_1_WrapperStruct00_var_1_14) * (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_11))) [L66] EXPR WrapperStruct00.var_1_7 [L66] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_7 [L68] EXPR WrapperStruct00.var_1_11 [L68] unsigned char stepLocal_1 = WrapperStruct00.var_1_11; [L69] EXPR WrapperStruct00.var_1_11 [L69] EXPR WrapperStruct00.var_1_11 [L69] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256, stepLocal_1=16, stepLocal_2=256] [L69] EXPR ((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14) [L69] EXPR WrapperStruct00.var_1_14 [L69] EXPR ((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256, stepLocal_1=16, stepLocal_2=256] [L69] EXPR WrapperStruct00.var_1_11 ^ ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256, stepLocal_1=16, stepLocal_2=256] [L69] unsigned long int stepLocal_0 = WrapperStruct00.var_1_11 ^ ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))); [L70] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256, stepLocal_0=16, stepLocal_1=16, stepLocal_2=256] [L70] COND FALSE !(stepLocal_0 != WrapperStruct00.var_1_11) [L75] WrapperStruct00.var_1_1 = 10.5f VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256, stepLocal_1=16, stepLocal_2=256] [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR WrapperStruct00.var_1_11 [L104] EXPR WrapperStruct00.var_1_11 [L104] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L104] EXPR ((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14) [L104] EXPR WrapperStruct00.var_1_14 [L104] EXPR ((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L104] EXPR WrapperStruct00.var_1_11 ^ ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L104] EXPR ((WrapperStruct00.var_1_11 ^ ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14)))) != WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_11 == (WrapperStruct00.var_1_11 - (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_11))) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1) : (WrapperStruct00.var_1_1 == ((float) 10.5f)) [L104] EXPR WrapperStruct00.var_1_1 [L104] EXPR ((WrapperStruct00.var_1_11 ^ ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14)))) != WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_11 == (WrapperStruct00.var_1_11 - (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_11))) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1) : (WrapperStruct00.var_1_1 == ((float) 10.5f)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L104] EXPR (((WrapperStruct00.var_1_11 ^ ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14)))) != WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_11 == (WrapperStruct00.var_1_11 - (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_11))) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1) : (WrapperStruct00.var_1_1 == ((float) 10.5f))) && ((last_1_WrapperStruct00_var_1_14 > WrapperStruct00.var_1_8) ? ((((last_1_WrapperStruct00_var_1_11 - WrapperStruct00.var_1_8) + WrapperStruct00.var_1_7) > last_1_WrapperStruct00_var_1_14) ? (WrapperStruct00.var_1_11 == ((unsigned char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((unsigned char) WrapperStruct00.var_1_12))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L104] EXPR ((((WrapperStruct00.var_1_11 ^ ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14)))) != WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_11 == (WrapperStruct00.var_1_11 - (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_11))) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1) : (WrapperStruct00.var_1_1 == ((float) 10.5f))) && ((last_1_WrapperStruct00_var_1_14 > WrapperStruct00.var_1_8) ? ((((last_1_WrapperStruct00_var_1_11 - WrapperStruct00.var_1_8) + WrapperStruct00.var_1_7) > last_1_WrapperStruct00_var_1_14) ? (WrapperStruct00.var_1_11 == ((unsigned char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((unsigned char) WrapperStruct00.var_1_12))) : 1)) && (((WrapperStruct00.var_1_11 & WrapperStruct00.var_1_7) > ((WrapperStruct00.var_1_12 * last_1_WrapperStruct00_var_1_14) * (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_11))) ? ((WrapperStruct00.var_1_15 && (WrapperStruct00.var_1_9 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_14 == ((unsigned long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_14 == ((unsigned long int) WrapperStruct00.var_1_7))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L104-L105] return ((((WrapperStruct00.var_1_11 ^ ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14)))) != WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_11 == (WrapperStruct00.var_1_11 - (WrapperStruct00.var_1_7 - WrapperStruct00.var_1_11))) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1) : (WrapperStruct00.var_1_1 == ((float) 10.5f))) && ((last_1_WrapperStruct00_var_1_14 > WrapperStruct00.var_1_8) ? ((((last_1_WrapperStruct00_var_1_11 - WrapperStruct00.var_1_8) + WrapperStruct00.var_1_7) > last_1_WrapperStruct00_var_1_14) ? (WrapperStruct00.var_1_11 == ((unsigned char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_11 == ((unsigned char) WrapperStruct00.var_1_12))) : 1)) && (((WrapperStruct00.var_1_11 & WrapperStruct00.var_1_7) > ((WrapperStruct00.var_1_12 * last_1_WrapperStruct00_var_1_14) * (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_11))) ? ((WrapperStruct00.var_1_15 && (WrapperStruct00.var_1_9 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_14 == ((unsigned long int) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_14 == ((unsigned long int) WrapperStruct00.var_1_7))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=16, last_1_WrapperStruct00_var_1_14=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.3s, OverallIterations: 27, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6327 SdHoareTripleChecker+Valid, 10.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6326 mSDsluCounter, 17719 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13817 mSDsCounter, 621 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15792 IncrementalHoareTripleChecker+Invalid, 16413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 621 mSolverCounterUnsat, 3902 mSDtfsCounter, 15792 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1280 GetRequests, 1003 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2661 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1474occurred in iteration=17, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 3271 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 3302 NumberOfCodeBlocks, 3302 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3150 ConstructedInterpolants, 0 QuantifiedInterpolants, 14434 SizeOfPredicates, 3 NumberOfNonLiveVariables, 420 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 28 InterpolantComputations, 25 PerfectInterpolantSequences, 7293/7392 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 18:42:09,186 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_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 3100141cd74ca703733adb7734016958254078594930776c79e4fb9d77d186b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:42:10,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:42:10,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:42:10,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:42:10,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:42:10,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:42:10,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:42:10,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:42:10,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:42:10,998 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:42:10,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:42:10,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:42:11,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:42:11,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:42:11,004 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:42:11,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:42:11,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:42:11,005 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:42:11,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:42:11,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:42:11,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:42:11,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:42:11,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:42:11,016 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:42:11,017 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:42:11,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:42:11,017 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:42:11,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:42:11,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:42:11,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:42:11,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:42:11,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:42:11,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:42:11,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:42:11,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:42:11,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:42:11,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:42:11,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:42:11,020 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:42:11,020 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:42:11,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:42:11,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:42:11,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:42:11,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:42:11,020 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 -> 3100141cd74ca703733adb7734016958254078594930776c79e4fb9d77d186b8 [2024-11-16 18:42:11,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:42:11,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:42:11,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:42:11,289 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:42:11,290 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:42:11,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-18.i [2024-11-16 18:42:12,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:42:12,728 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:42:12,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-18.i [2024-11-16 18:42:12,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33303ba9/2d8ff557d3954fedbbbee54c30532bd0/FLAG25d68958e [2024-11-16 18:42:13,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33303ba9/2d8ff557d3954fedbbbee54c30532bd0 [2024-11-16 18:42:13,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:42:13,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:42:13,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:42:13,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:42:13,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:42:13,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:42:13" (1/1) ... [2024-11-16 18:42:13,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e22665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:42:13, skipping insertion in model container [2024-11-16 18:42:13,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:42:13" (1/1) ... [2024-11-16 18:42:13,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:42:13,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-18.i[916,929] [2024-11-16 18:42:13,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:42:13,388 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:42:13,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-18.i[916,929] [2024-11-16 18:42:13,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:42:13,460 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:42:13,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:42:13 WrapperNode [2024-11-16 18:42:13,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:42:13,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:42:13,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:42:13,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:42:13,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:42:13" (1/1) ... [2024-11-16 18:42:13,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:42:13" (1/1) ... [2024-11-16 18:42:13,523 INFO L138 Inliner]: procedures = 37, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 432 [2024-11-16 18:42:13,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:42:13,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:42:13,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:42:13,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:42:13,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:42:13" (1/1) ... [2024-11-16 18:42:13,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:42:13" (1/1) ... [2024-11-16 18:42:13,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:42:13" (1/1) ... [2024-11-16 18:42:13,576 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 24 writes are split as follows [0, 24]. [2024-11-16 18:42:13,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:42:13" (1/1) ... [2024-11-16 18:42:13,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:42:13" (1/1) ... [2024-11-16 18:42:13,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:42:13" (1/1) ... [2024-11-16 18:42:13,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:42:13" (1/1) ... [2024-11-16 18:42:13,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:42:13" (1/1) ... [2024-11-16 18:42:13,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:42:13" (1/1) ... [2024-11-16 18:42:13,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:42:13,605 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:42:13,605 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:42:13,605 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:42:13,606 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:42:13" (1/1) ... [2024-11-16 18:42:13,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:42:13,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:42:13,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:42:13,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:42:13,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:42:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 18:42:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 18:42:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:42:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 18:42:13,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-16 18:42:13,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-16 18:42:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 18:42:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 18:42:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-16 18:42:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-16 18:42:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-16 18:42:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-16 18:42:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-16 18:42:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-16 18:42:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-16 18:42:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-16 18:42:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-16 18:42:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-16 18:42:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:42:13,679 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:42:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-16 18:42:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-16 18:42:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:42:13,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:42:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-16 18:42:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-16 18:42:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-16 18:42:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-16 18:42:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-16 18:42:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-16 18:42:13,789 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:42:13,791 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:42:14,389 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem78#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem79#1;havoc property_#t~ite92#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite88#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~ite105#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite104#1;havoc property_#t~mem101#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short115#1;havoc property_#t~ite118#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short122#1; [2024-11-16 18:42:14,416 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-16 18:42:14,416 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:42:14,429 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:42:14,429 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:42:14,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:42:14 BoogieIcfgContainer [2024-11-16 18:42:14,429 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:42:14,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:42:14,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:42:14,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:42:14,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:42:13" (1/3) ... [2024-11-16 18:42:14,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75866ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:42:14, skipping insertion in model container [2024-11-16 18:42:14,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:42:13" (2/3) ... [2024-11-16 18:42:14,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75866ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:42:14, skipping insertion in model container [2024-11-16 18:42:14,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:42:14" (3/3) ... [2024-11-16 18:42:14,436 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-18.i [2024-11-16 18:42:14,447 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:42:14,447 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:42:14,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:42:14,509 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;@67ce14c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:42:14,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:42:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:42:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:42:14,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:14,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, 1, 1, 1] [2024-11-16 18:42:14,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:14,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:14,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1217543565, now seen corresponding path program 1 times [2024-11-16 18:42:14,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:14,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660554274] [2024-11-16 18:42:14,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:14,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:14,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:14,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:42:14,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 18:42:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:14,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:42:14,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-16 18:42:14,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:42:14,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:14,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660554274] [2024-11-16 18:42:14,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660554274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:14,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:14,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:42:14,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540454201] [2024-11-16 18:42:14,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:14,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:42:14,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:14,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:42:14,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:42:14,860 INFO L87 Difference]: Start difference. First operand has 95 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 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 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:42:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:14,887 INFO L93 Difference]: Finished difference Result 182 states and 279 transitions. [2024-11-16 18:42:14,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:42:14,889 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 105 [2024-11-16 18:42:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:14,895 INFO L225 Difference]: With dead ends: 182 [2024-11-16 18:42:14,896 INFO L226 Difference]: Without dead ends: 90 [2024-11-16 18:42:14,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:42:14,902 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:14,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:42:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-16 18:42:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-16 18:42:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 18:42:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-11-16 18:42:14,944 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 105 [2024-11-16 18:42:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:14,945 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-11-16 18:42:14,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:42:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-11-16 18:42:14,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:42:14,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:14,949 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-11-16 18:42:14,956 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 (2)] Forceful destruction successful, exit code 0 [2024-11-16 18:42:15,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:15,150 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:15,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:15,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1413508617, now seen corresponding path program 1 times [2024-11-16 18:42:15,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:15,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129634393] [2024-11-16 18:42:15,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:15,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:15,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:15,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:42:15,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 18:42:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:15,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:42:15,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:15,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:42:15,454 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 80 treesize of output 44 [2024-11-16 18:42:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:15,486 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:42:15,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:15,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129634393] [2024-11-16 18:42:15,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129634393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:15,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:15,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:42:15,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045612585] [2024-11-16 18:42:15,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:15,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:42:15,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:15,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:42:15,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:42:15,490 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:16,361 INFO L93 Difference]: Finished difference Result 266 states and 384 transitions. [2024-11-16 18:42:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:42:16,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 105 [2024-11-16 18:42:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:16,364 INFO L225 Difference]: With dead ends: 266 [2024-11-16 18:42:16,365 INFO L226 Difference]: Without dead ends: 179 [2024-11-16 18:42:16,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:42:16,367 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 112 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:16,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 563 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 18:42:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-16 18:42:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2024-11-16 18:42:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 147 states have (on average 1.3877551020408163) internal successors, (204), 147 states have internal predecessors, (204), 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-11-16 18:42:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 252 transitions. [2024-11-16 18:42:16,393 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 252 transitions. Word has length 105 [2024-11-16 18:42:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:16,393 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 252 transitions. [2024-11-16 18:42:16,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 252 transitions. [2024-11-16 18:42:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:42:16,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:16,395 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-11-16 18:42:16,402 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-11-16 18:42:16,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:16,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:16,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:16,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1218929174, now seen corresponding path program 1 times [2024-11-16 18:42:16,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:16,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638207338] [2024-11-16 18:42:16,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:16,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:16,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:16,600 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:42:16,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 18:42:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:16,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 18:42:16,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:16,877 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 62 treesize of output 26 [2024-11-16 18:42:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:16,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:42:16,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:16,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638207338] [2024-11-16 18:42:16,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638207338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:16,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:16,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:42:16,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714891075] [2024-11-16 18:42:16,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:16,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:42:16,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:16,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:42:16,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:42:16,923 INFO L87 Difference]: Start difference. First operand 174 states and 252 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-11-16 18:42:18,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:18,197 INFO L93 Difference]: Finished difference Result 528 states and 768 transitions. [2024-11-16 18:42:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:42:18,198 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-11-16 18:42:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:18,200 INFO L225 Difference]: With dead ends: 528 [2024-11-16 18:42:18,201 INFO L226 Difference]: Without dead ends: 357 [2024-11-16 18:42:18,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:42:18,205 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 120 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:18,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 367 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 18:42:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-16 18:42:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 348. [2024-11-16 18:42:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 295 states have (on average 1.3796610169491526) internal successors, (407), 295 states have internal predecessors, (407), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 18:42:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 503 transitions. [2024-11-16 18:42:18,244 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 503 transitions. Word has length 106 [2024-11-16 18:42:18,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:18,244 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 503 transitions. [2024-11-16 18:42:18,244 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-11-16 18:42:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 503 transitions. [2024-11-16 18:42:18,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:42:18,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:18,246 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-11-16 18:42:18,253 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 (4)] Ended with exit code 0 [2024-11-16 18:42:18,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:18,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:18,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:18,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1348011893, now seen corresponding path program 1 times [2024-11-16 18:42:18,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:18,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888705699] [2024-11-16 18:42:18,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:18,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:18,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:18,450 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-11-16 18:42:18,451 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-11-16 18:42:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:18,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 18:42:18,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:18,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:42:18,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:18,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888705699] [2024-11-16 18:42:18,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888705699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:18,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:18,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:42:18,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925324899] [2024-11-16 18:42:18,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:18,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:42:18,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:18,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:42:18,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:42:18,682 INFO L87 Difference]: Start difference. First operand 348 states and 503 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-11-16 18:42:19,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:19,783 INFO L93 Difference]: Finished difference Result 936 states and 1355 transitions. [2024-11-16 18:42:19,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:42:19,783 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-11-16 18:42:19,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:19,788 INFO L225 Difference]: With dead ends: 936 [2024-11-16 18:42:19,789 INFO L226 Difference]: Without dead ends: 591 [2024-11-16 18:42:19,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:42:19,792 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 106 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:19,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 462 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 18:42:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-16 18:42:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 582. [2024-11-16 18:42:19,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 490 states have (on average 1.3653061224489795) internal successors, (669), 490 states have internal predecessors, (669), 84 states have call successors, (84), 7 states have call predecessors, (84), 7 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-16 18:42:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 837 transitions. [2024-11-16 18:42:19,829 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 837 transitions. Word has length 106 [2024-11-16 18:42:19,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:19,829 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 837 transitions. [2024-11-16 18:42:19,829 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-11-16 18:42:19,830 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 837 transitions. [2024-11-16 18:42:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:42:19,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:19,831 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-11-16 18:42:19,841 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-11-16 18:42:20,032 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-11-16 18:42:20,032 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:20,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:20,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1593645706, now seen corresponding path program 1 times [2024-11-16 18:42:20,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:20,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097561647] [2024-11-16 18:42:20,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:20,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:20,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:20,036 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:42:20,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 18:42:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:20,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 18:42:20,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:20,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:20,308 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 58 treesize of output 22 [2024-11-16 18:42:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:20,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:42:20,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:20,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097561647] [2024-11-16 18:42:20,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097561647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:20,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:20,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:42:20,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711506748] [2024-11-16 18:42:20,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:20,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:42:20,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:20,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:42:20,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:42:20,341 INFO L87 Difference]: Start difference. First operand 582 states and 837 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-11-16 18:42:21,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:21,981 INFO L93 Difference]: Finished difference Result 1588 states and 2284 transitions. [2024-11-16 18:42:21,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:42:21,983 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-11-16 18:42:21,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:21,989 INFO L225 Difference]: With dead ends: 1588 [2024-11-16 18:42:21,990 INFO L226 Difference]: Without dead ends: 1009 [2024-11-16 18:42:21,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:42:21,993 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 116 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:21,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 439 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 18:42:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-11-16 18:42:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1002. [2024-11-16 18:42:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 845 states have (on average 1.3585798816568047) internal successors, (1148), 845 states have internal predecessors, (1148), 144 states have call successors, (144), 12 states have call predecessors, (144), 12 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2024-11-16 18:42:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1436 transitions. [2024-11-16 18:42:22,061 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1436 transitions. Word has length 106 [2024-11-16 18:42:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:22,062 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1436 transitions. [2024-11-16 18:42:22,062 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-11-16 18:42:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1436 transitions. [2024-11-16 18:42:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 18:42:22,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:22,064 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-11-16 18:42:22,070 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-11-16 18:42:22,264 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-11-16 18:42:22,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:22,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1545787426, now seen corresponding path program 1 times [2024-11-16 18:42:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:22,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373178472] [2024-11-16 18:42:22,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:22,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:22,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:22,269 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-11-16 18:42:22,273 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-11-16 18:42:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:22,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 18:42:22,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:22,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:42:22,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:22,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373178472] [2024-11-16 18:42:22,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373178472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:22,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:22,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:42:22,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892128458] [2024-11-16 18:42:22,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:22,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:42:22,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:22,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:42:22,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:42:22,528 INFO L87 Difference]: Start difference. First operand 1002 states and 1436 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:23,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:23,629 INFO L93 Difference]: Finished difference Result 2025 states and 2909 transitions. [2024-11-16 18:42:23,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:42:23,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (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-11-16 18:42:23,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:23,636 INFO L225 Difference]: With dead ends: 2025 [2024-11-16 18:42:23,636 INFO L226 Difference]: Without dead ends: 1026 [2024-11-16 18:42:23,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:42:23,639 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 108 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:23,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 228 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 18:42:23,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-11-16 18:42:23,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 670. [2024-11-16 18:42:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 565 states have (on average 1.3486725663716814) internal successors, (762), 565 states have internal predecessors, (762), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-16 18:42:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 954 transitions. [2024-11-16 18:42:23,682 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 954 transitions. Word has length 107 [2024-11-16 18:42:23,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:23,683 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 954 transitions. [2024-11-16 18:42:23,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 954 transitions. [2024-11-16 18:42:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 18:42:23,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:23,686 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-11-16 18:42:23,694 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-11-16 18:42:23,886 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 [2024-11-16 18:42:23,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:23,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:23,887 INFO L85 PathProgramCache]: Analyzing trace with hash -319897765, now seen corresponding path program 1 times [2024-11-16 18:42:23,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:23,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516911457] [2024-11-16 18:42:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:23,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:23,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:23,889 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:42:23,890 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 (8)] Waiting until timeout for monitored process [2024-11-16 18:42:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:24,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:42:24,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:24,062 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:42:24,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:24,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516911457] [2024-11-16 18:42:24,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516911457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:24,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:24,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:42:24,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880365882] [2024-11-16 18:42:24,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:24,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:42:24,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:24,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:42:24,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:42:24,065 INFO L87 Difference]: Start difference. First operand 670 states and 954 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:24,117 INFO L93 Difference]: Finished difference Result 1361 states and 1937 transitions. [2024-11-16 18:42:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:42:24,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (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-11-16 18:42:24,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:24,121 INFO L225 Difference]: With dead ends: 1361 [2024-11-16 18:42:24,121 INFO L226 Difference]: Without dead ends: 694 [2024-11-16 18:42:24,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:42:24,124 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:24,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:42:24,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-16 18:42:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 686. [2024-11-16 18:42:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 581 states have (on average 1.3390705679862307) internal successors, (778), 581 states have internal predecessors, (778), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-16 18:42:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 970 transitions. [2024-11-16 18:42:24,150 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 970 transitions. Word has length 107 [2024-11-16 18:42:24,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:24,151 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 970 transitions. [2024-11-16 18:42:24,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:24,151 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 970 transitions. [2024-11-16 18:42:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 18:42:24,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:24,153 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-11-16 18:42:24,160 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 (8)] Ended with exit code 0 [2024-11-16 18:42:24,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:24,355 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:24,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash -825306338, now seen corresponding path program 1 times [2024-11-16 18:42:24,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:24,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986352719] [2024-11-16 18:42:24,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:24,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:24,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:24,361 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-11-16 18:42:24,362 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-11-16 18:42:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:24,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:42:24,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:24,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:42:24,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:24,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986352719] [2024-11-16 18:42:24,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986352719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:24,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:24,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:42:24,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106526240] [2024-11-16 18:42:24,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:24,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:42:24,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:24,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:42:24,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:42:24,553 INFO L87 Difference]: Start difference. First operand 686 states and 970 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:24,591 INFO L93 Difference]: Finished difference Result 1393 states and 1969 transitions. [2024-11-16 18:42:24,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:42:24,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (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-11-16 18:42:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:24,594 INFO L225 Difference]: With dead ends: 1393 [2024-11-16 18:42:24,595 INFO L226 Difference]: Without dead ends: 710 [2024-11-16 18:42:24,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:42:24,596 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:24,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 488 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:42:24,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-16 18:42:24,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-16 18:42:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 605 states have (on average 1.3256198347107437) internal successors, (802), 605 states have internal predecessors, (802), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-16 18:42:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 994 transitions. [2024-11-16 18:42:24,619 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 994 transitions. Word has length 107 [2024-11-16 18:42:24,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:24,620 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 994 transitions. [2024-11-16 18:42:24,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 994 transitions. [2024-11-16 18:42:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 18:42:24,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:24,622 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-11-16 18:42:24,628 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 (9)] Ended with exit code 0 [2024-11-16 18:42:24,822 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 [2024-11-16 18:42:24,823 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:24,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:24,823 INFO L85 PathProgramCache]: Analyzing trace with hash -845703527, now seen corresponding path program 1 times [2024-11-16 18:42:24,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:24,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745570238] [2024-11-16 18:42:24,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:24,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:24,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:24,826 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:42:24,828 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 (10)] Waiting until timeout for monitored process [2024-11-16 18:42:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:25,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-16 18:42:25,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:25,051 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 19 treesize of output 1 [2024-11-16 18:42:25,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-16 18:42:25,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:25,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-16 18:42:25,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:25,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-16 18:42:25,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:25,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-16 18:42:25,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:25,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 38 [2024-11-16 18:42:25,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:25,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-11-16 18:42:25,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:25,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 65 [2024-11-16 18:42:25,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:25,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 68 treesize of output 26 [2024-11-16 18:42:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 163 proven. 33 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-16 18:42:25,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:42:26,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:26,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745570238] [2024-11-16 18:42:26,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745570238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:42:26,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [314269818] [2024-11-16 18:42:26,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:26,026 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 18:42:26,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 18:42:26,029 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 18:42:26,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-16 18:42:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:26,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 18:42:26,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:26,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:42:26,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-16 18:42:26,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:26,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2024-11-16 18:42:26,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:26,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2024-11-16 18:42:26,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:26,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 44 [2024-11-16 18:42:27,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:27,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 44 [2024-11-16 18:42:27,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:27,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 44 [2024-11-16 18:42:27,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:27,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 44 [2024-11-16 18:42:27,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:27,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 44 [2024-11-16 18:42:27,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:27,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 46 [2024-11-16 18:42:27,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:27,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 36 [2024-11-16 18:42:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-16 18:42:27,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:42:27,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [314269818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:27,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:42:27,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2024-11-16 18:42:27,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787435493] [2024-11-16 18:42:27,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:27,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:42:27,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:27,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:42:27,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2024-11-16 18:42:27,823 INFO L87 Difference]: Start difference. First operand 710 states and 994 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:42:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:29,636 INFO L93 Difference]: Finished difference Result 1597 states and 2227 transitions. [2024-11-16 18:42:29,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:42:29,636 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 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 109 [2024-11-16 18:42:29,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:29,640 INFO L225 Difference]: With dead ends: 1597 [2024-11-16 18:42:29,640 INFO L226 Difference]: Without dead ends: 890 [2024-11-16 18:42:29,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2024-11-16 18:42:29,642 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 191 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:29,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 535 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-16 18:42:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-11-16 18:42:29,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 799. [2024-11-16 18:42:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 681 states have (on average 1.3245227606461087) internal successors, (902), 681 states have internal predecessors, (902), 108 states have call successors, (108), 9 states have call predecessors, (108), 9 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-16 18:42:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1118 transitions. [2024-11-16 18:42:29,678 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1118 transitions. Word has length 109 [2024-11-16 18:42:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:29,678 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1118 transitions. [2024-11-16 18:42:29,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 18:42:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1118 transitions. [2024-11-16 18:42:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 18:42:29,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:29,680 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-11-16 18:42:29,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-16 18:42:29,887 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 (10)] Forceful destruction successful, exit code 0 [2024-11-16 18:42:30,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:30,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:30,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:30,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1225804400, now seen corresponding path program 1 times [2024-11-16 18:42:30,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:30,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720751208] [2024-11-16 18:42:30,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:30,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:30,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:30,082 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:42:30,083 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 (12)] Waiting until timeout for monitored process [2024-11-16 18:42:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:30,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:42:30,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:30,279 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 44 treesize of output 20 [2024-11-16 18:42:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:30,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:42:30,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:30,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720751208] [2024-11-16 18:42:30,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720751208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:30,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:30,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:42:30,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854845327] [2024-11-16 18:42:30,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:30,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:42:30,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:30,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:42:30,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:42:30,294 INFO L87 Difference]: Start difference. First operand 799 states and 1118 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-11-16 18:42:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:30,847 INFO L93 Difference]: Finished difference Result 1342 states and 1879 transitions. [2024-11-16 18:42:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:42:30,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-11-16 18:42:30,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:30,850 INFO L225 Difference]: With dead ends: 1342 [2024-11-16 18:42:30,850 INFO L226 Difference]: Without dead ends: 635 [2024-11-16 18:42:30,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:42:30,854 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:30,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 381 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:42:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-16 18:42:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 458. [2024-11-16 18:42:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 392 states have (on average 1.3265306122448979) internal successors, (520), 392 states have internal predecessors, (520), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 18:42:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 640 transitions. [2024-11-16 18:42:30,887 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 640 transitions. Word has length 110 [2024-11-16 18:42:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:30,888 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 640 transitions. [2024-11-16 18:42:30,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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-11-16 18:42:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 640 transitions. [2024-11-16 18:42:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 18:42:30,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:30,890 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-11-16 18:42:30,899 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 (12)] Forceful destruction successful, exit code 0 [2024-11-16 18:42:31,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:31,091 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:31,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:31,092 INFO L85 PathProgramCache]: Analyzing trace with hash 306445998, now seen corresponding path program 1 times [2024-11-16 18:42:31,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:31,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898887139] [2024-11-16 18:42:31,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:31,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:31,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:31,095 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-11-16 18:42:31,096 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-11-16 18:42:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:31,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 18:42:31,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:31,337 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 19 treesize of output 1 [2024-11-16 18:42:31,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-16 18:42:31,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:31,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-16 18:42:31,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:31,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-16 18:42:31,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:31,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 38 [2024-11-16 18:42:31,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:31,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-11-16 18:42:31,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:31,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2024-11-16 18:42:31,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:31,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 67 [2024-11-16 18:42:31,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:31,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 78 [2024-11-16 18:42:32,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:32,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 30 [2024-11-16 18:42:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 195 proven. 33 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-16 18:42:32,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:42:32,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:32,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898887139] [2024-11-16 18:42:32,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898887139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:42:32,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [55917055] [2024-11-16 18:42:32,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:32,205 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 18:42:32,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 18:42:32,206 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 18:42:32,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-16 18:42:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:32,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 18:42:32,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:32,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:42:32,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 18:42:32,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 18:42:32,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 18:42:33,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 18:42:33,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 18:42:33,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 18:42:33,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 18:42:33,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-16 18:42:33,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:33,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2024-11-16 18:42:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:42:33,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:42:33,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [55917055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:42:33,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:42:33,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2024-11-16 18:42:33,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688476420] [2024-11-16 18:42:33,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:42:33,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 18:42:33,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:33,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 18:42:33,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2024-11-16 18:42:33,260 INFO L87 Difference]: Start difference. First operand 458 states and 640 transitions. Second operand has 19 states, 17 states have (on average 6.176470588235294) internal successors, (105), 19 states have internal predecessors, (105), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-16 18:42:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:35,984 INFO L93 Difference]: Finished difference Result 1043 states and 1374 transitions. [2024-11-16 18:42:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-16 18:42:35,985 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.176470588235294) internal successors, (105), 19 states have internal predecessors, (105), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) Word has length 110 [2024-11-16 18:42:35,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:35,987 INFO L225 Difference]: With dead ends: 1043 [2024-11-16 18:42:35,987 INFO L226 Difference]: Without dead ends: 677 [2024-11-16 18:42:35,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 253 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=400, Invalid=1492, Unknown=0, NotChecked=0, Total=1892 [2024-11-16 18:42:35,990 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 362 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:35,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 547 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-16 18:42:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-11-16 18:42:36,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 451. [2024-11-16 18:42:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 378 states have (on average 1.2777777777777777) internal successors, (483), 378 states have internal predecessors, (483), 48 states have call successors, (48), 24 states have call predecessors, (48), 24 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 18:42:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 579 transitions. [2024-11-16 18:42:36,023 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 579 transitions. Word has length 110 [2024-11-16 18:42:36,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:36,024 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 579 transitions. [2024-11-16 18:42:36,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.176470588235294) internal successors, (105), 19 states have internal predecessors, (105), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-16 18:42:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 579 transitions. [2024-11-16 18:42:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 18:42:36,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:36,025 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-11-16 18:42:36,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-16 18:42:36,233 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-11-16 18:42:36,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-11-16 18:42:36,426 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:36,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:36,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1251511034, now seen corresponding path program 1 times [2024-11-16 18:42:36,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:36,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796701436] [2024-11-16 18:42:36,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:36,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:36,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:36,428 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-11-16 18:42:36,429 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-11-16 18:42:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:36,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 18:42:36,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:36,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:36,646 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 65 treesize of output 29 [2024-11-16 18:42:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:36,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:42:36,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:36,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796701436] [2024-11-16 18:42:36,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796701436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:36,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:36,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:42:36,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353860579] [2024-11-16 18:42:36,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:36,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:42:36,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:36,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:42:36,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:42:36,674 INFO L87 Difference]: Start difference. First operand 451 states and 579 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-11-16 18:42:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:37,265 INFO L93 Difference]: Finished difference Result 995 states and 1277 transitions. [2024-11-16 18:42:37,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:42:37,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-11-16 18:42:37,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:37,268 INFO L225 Difference]: With dead ends: 995 [2024-11-16 18:42:37,268 INFO L226 Difference]: Without dead ends: 547 [2024-11-16 18:42:37,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:42:37,269 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 38 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:37,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 354 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:42:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-16 18:42:37,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 466. [2024-11-16 18:42:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 393 states have (on average 1.2671755725190839) internal successors, (498), 393 states have internal predecessors, (498), 48 states have call successors, (48), 24 states have call predecessors, (48), 24 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 18:42:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 594 transitions. [2024-11-16 18:42:37,299 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 594 transitions. Word has length 110 [2024-11-16 18:42:37,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:37,299 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 594 transitions. [2024-11-16 18:42:37,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-11-16 18:42:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 594 transitions. [2024-11-16 18:42:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 18:42:37,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:37,300 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, 1, 1] [2024-11-16 18:42:37,312 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 (15)] Ended with exit code 0 [2024-11-16 18:42:37,500 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-11-16 18:42:37,501 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:37,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:37,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1458985188, now seen corresponding path program 1 times [2024-11-16 18:42:37,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:37,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561022906] [2024-11-16 18:42:37,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:37,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:37,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:37,505 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-11-16 18:42:37,510 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-11-16 18:42:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:37,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-16 18:42:37,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:37,751 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 14 treesize of output 10 [2024-11-16 18:42:37,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-16 18:42:37,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:37,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 32 [2024-11-16 18:42:38,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:38,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 32 [2024-11-16 18:42:38,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:38,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 42 [2024-11-16 18:42:38,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:38,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 40 [2024-11-16 18:42:38,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:38,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2024-11-16 18:42:38,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:38,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2024-11-16 18:42:38,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:38,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 25 [2024-11-16 18:42:38,644 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 179 proven. 33 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-16 18:42:38,644 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:42:38,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:38,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561022906] [2024-11-16 18:42:38,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561022906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:42:38,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [56563159] [2024-11-16 18:42:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:38,710 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 18:42:38,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 18:42:38,711 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 18:42:38,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-16 18:42:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:39,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 18:42:39,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:39,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:42:39,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 18:42:39,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 18:42:39,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 18:42:39,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-16 18:42:39,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-16 18:42:39,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:39,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-16 18:42:39,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:39,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2024-11-16 18:42:39,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:39,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 18 [2024-11-16 18:42:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 123 proven. 33 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-16 18:42:39,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:42:39,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [56563159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:42:39,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:42:39,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-16 18:42:39,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597209903] [2024-11-16 18:42:39,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:42:39,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 18:42:39,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:39,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 18:42:39,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2024-11-16 18:42:39,901 INFO L87 Difference]: Start difference. First operand 466 states and 594 transitions. Second operand has 19 states, 17 states have (on average 6.176470588235294) internal successors, (105), 18 states have internal predecessors, (105), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-16 18:42:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:44,403 INFO L93 Difference]: Finished difference Result 765 states and 969 transitions. [2024-11-16 18:42:44,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-16 18:42:44,404 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.176470588235294) internal successors, (105), 18 states have internal predecessors, (105), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) Word has length 112 [2024-11-16 18:42:44,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:44,405 INFO L225 Difference]: With dead ends: 765 [2024-11-16 18:42:44,405 INFO L226 Difference]: Without dead ends: 302 [2024-11-16 18:42:44,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 261 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=489, Invalid=1673, Unknown=0, NotChecked=0, Total=2162 [2024-11-16 18:42:44,407 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 500 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:44,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 531 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-16 18:42:44,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-16 18:42:44,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 239. [2024-11-16 18:42:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 202 states have (on average 1.2574257425742574) internal successors, (254), 202 states have internal predecessors, (254), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 18:42:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 302 transitions. [2024-11-16 18:42:44,425 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 302 transitions. Word has length 112 [2024-11-16 18:42:44,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:44,428 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 302 transitions. [2024-11-16 18:42:44,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.176470588235294) internal successors, (105), 18 states have internal predecessors, (105), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-16 18:42:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 302 transitions. [2024-11-16 18:42:44,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 18:42:44,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:44,429 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, 1, 1] [2024-11-16 18:42:44,438 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 (16)] Forceful destruction successful, exit code 0 [2024-11-16 18:42:44,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-11-16 18:42:44,829 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 18:42:44,829 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:44,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:44,830 INFO L85 PathProgramCache]: Analyzing trace with hash -724754884, now seen corresponding path program 1 times [2024-11-16 18:42:44,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:44,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980031818] [2024-11-16 18:42:44,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:44,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:44,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:44,832 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-11-16 18:42:44,833 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-11-16 18:42:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:45,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 18:42:45,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:45,064 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 8 treesize of output 1 [2024-11-16 18:42:45,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-16 18:42:45,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-16 18:42:45,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-16 18:42:45,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-16 18:42:45,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-16 18:42:45,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:45,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 38 [2024-11-16 18:42:45,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:45,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 52 [2024-11-16 18:42:45,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:45,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 55 [2024-11-16 18:42:45,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:45,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 89 treesize of output 35 [2024-11-16 18:42:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 139 proven. 33 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-16 18:42:45,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:42:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-16 18:42:45,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:45,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980031818] [2024-11-16 18:42:45,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980031818] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 18:42:45,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:42:45,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2024-11-16 18:42:45,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111974924] [2024-11-16 18:42:45,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:42:45,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 18:42:45,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:45,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 18:42:45,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:42:45,798 INFO L87 Difference]: Start difference. First operand 239 states and 302 transitions. Second operand has 15 states, 13 states have (on average 8.076923076923077) internal successors, (105), 15 states have internal predecessors, (105), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-16 18:42:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:47,051 INFO L93 Difference]: Finished difference Result 523 states and 655 transitions. [2024-11-16 18:42:47,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-16 18:42:47,052 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 8.076923076923077) internal successors, (105), 15 states have internal predecessors, (105), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 112 [2024-11-16 18:42:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:47,053 INFO L225 Difference]: With dead ends: 523 [2024-11-16 18:42:47,053 INFO L226 Difference]: Without dead ends: 287 [2024-11-16 18:42:47,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2024-11-16 18:42:47,054 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 195 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:47,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 283 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 18:42:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-16 18:42:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 219. [2024-11-16 18:42:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 182 states have (on average 1.2527472527472527) internal successors, (228), 182 states have internal predecessors, (228), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 18:42:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 276 transitions. [2024-11-16 18:42:47,074 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 276 transitions. Word has length 112 [2024-11-16 18:42:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:47,075 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 276 transitions. [2024-11-16 18:42:47,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 8.076923076923077) internal successors, (105), 15 states have internal predecessors, (105), 6 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-16 18:42:47,075 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 276 transitions. [2024-11-16 18:42:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 18:42:47,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:47,076 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, 1, 1] [2024-11-16 18:42:47,085 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 (18)] Ended with exit code 0 [2024-11-16 18:42:47,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:47,276 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:47,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:47,277 INFO L85 PathProgramCache]: Analyzing trace with hash -413656705, now seen corresponding path program 1 times [2024-11-16 18:42:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984378930] [2024-11-16 18:42:47,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:47,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:47,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:47,280 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:42:47,281 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 (19)] Waiting until timeout for monitored process [2024-11-16 18:42:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:47,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-16 18:42:47,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:47,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:42:47,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:42:47,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:42:47,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2024-11-16 18:42:47,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:47,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 12 [2024-11-16 18:42:47,561 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 19 treesize of output 1 [2024-11-16 18:42:47,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-16 18:42:47,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-16 18:42:47,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-16 18:42:47,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-11-16 18:42:47,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:47,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 52 treesize of output 33 [2024-11-16 18:42:48,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:48,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 59 [2024-11-16 18:42:48,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:48,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 30 [2024-11-16 18:42:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 162 proven. 48 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-16 18:42:48,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:42:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:48,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:48,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984378930] [2024-11-16 18:42:48,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984378930] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:42:48,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:42:48,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2024-11-16 18:42:48,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144999464] [2024-11-16 18:42:48,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:48,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:42:48,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:48,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:42:48,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-16 18:42:48,561 INFO L87 Difference]: Start difference. First operand 219 states and 276 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:49,114 INFO L93 Difference]: Finished difference Result 496 states and 623 transitions. [2024-11-16 18:42:49,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:42:49,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 112 [2024-11-16 18:42:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:49,116 INFO L225 Difference]: With dead ends: 496 [2024-11-16 18:42:49,116 INFO L226 Difference]: Without dead ends: 280 [2024-11-16 18:42:49,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-11-16 18:42:49,117 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 60 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:49,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 249 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:42:49,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-16 18:42:49,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 249. [2024-11-16 18:42:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 212 states have internal predecessors, (262), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 18:42:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 310 transitions. [2024-11-16 18:42:49,137 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 310 transitions. Word has length 112 [2024-11-16 18:42:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:49,138 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 310 transitions. [2024-11-16 18:42:49,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 18:42:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 310 transitions. [2024-11-16 18:42:49,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 18:42:49,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:49,139 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, 1, 1] [2024-11-16 18:42:49,146 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 (19)] Forceful destruction successful, exit code 0 [2024-11-16 18:42:49,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:49,339 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:49,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:49,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1270255219, now seen corresponding path program 1 times [2024-11-16 18:42:49,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:49,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514390924] [2024-11-16 18:42:49,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:49,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:49,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:49,341 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:42:49,346 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 (20)] Waiting until timeout for monitored process [2024-11-16 18:42:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:49,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 18:42:49,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:49,577 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 19 treesize of output 1 [2024-11-16 18:42:49,579 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 14 treesize of output 10 [2024-11-16 18:42:49,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-16 18:42:49,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-16 18:42:49,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-16 18:42:49,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-16 18:42:49,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-16 18:42:49,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:49,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2024-11-16 18:42:49,930 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 18:42:49,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:42:49,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:49,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514390924] [2024-11-16 18:42:49,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514390924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:49,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:49,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:42:49,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715948984] [2024-11-16 18:42:49,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:49,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:42:49,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:49,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:42:49,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:42:49,932 INFO L87 Difference]: Start difference. First operand 249 states and 310 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-16 18:42:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:42:50,997 INFO L93 Difference]: Finished difference Result 311 states and 383 transitions. [2024-11-16 18:42:50,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:42:50,997 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2024-11-16 18:42:50,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:42:50,999 INFO L225 Difference]: With dead ends: 311 [2024-11-16 18:42:50,999 INFO L226 Difference]: Without dead ends: 308 [2024-11-16 18:42:50,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:42:50,999 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 226 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:42:51,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 351 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 18:42:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-16 18:42:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 294. [2024-11-16 18:42:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 257 states have (on average 1.2295719844357977) internal successors, (316), 257 states have internal predecessors, (316), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 18:42:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 364 transitions. [2024-11-16 18:42:51,026 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 364 transitions. Word has length 112 [2024-11-16 18:42:51,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:42:51,026 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 364 transitions. [2024-11-16 18:42:51,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-16 18:42:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 364 transitions. [2024-11-16 18:42:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 18:42:51,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:42:51,027 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, 1, 1, 1] [2024-11-16 18:42:51,036 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 (20)] Forceful destruction successful, exit code 0 [2024-11-16 18:42:51,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:51,228 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:42:51,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:42:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2105787062, now seen corresponding path program 1 times [2024-11-16 18:42:51,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:42:51,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400487988] [2024-11-16 18:42:51,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:42:51,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:42:51,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:42:51,229 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:42:51,230 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 (21)] Waiting until timeout for monitored process [2024-11-16 18:42:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:42:51,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 18:42:51,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:42:51,458 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 8 treesize of output 1 [2024-11-16 18:42:51,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2024-11-16 18:42:51,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:51,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-16 18:42:51,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:42:51,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 35 [2024-11-16 18:42:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 18:42:51,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:42:51,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:42:51,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400487988] [2024-11-16 18:42:51,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400487988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:42:51,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:42:51,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:42:51,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866393085] [2024-11-16 18:42:51,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:42:51,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:42:51,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:42:51,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:42:51,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:42:51,583 INFO L87 Difference]: Start difference. First operand 294 states and 364 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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)