./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:43:34,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:43:34,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:43:34,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:43:34,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:43:34,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:43:34,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:43:34,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:43:34,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:43:34,536 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:43:34,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:43:34,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:43:34,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:43:34,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:43:34,540 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:43:34,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:43:34,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:43:34,541 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:43:34,541 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:43:34,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:43:34,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:43:34,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:43:34,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:43:34,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:43:34,543 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:43:34,543 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:43:34,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:43:34,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:43:34,544 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:43:34,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:43:34,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:43:34,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:43:34,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:43:34,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:43:34,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:43:34,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:43:34,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:43:34,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:43:34,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:43:34,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:43:34,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:43:34,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:43:34,550 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-clean/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-clean/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 -> aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 [2024-10-11 13:43:34,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:43:34,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:43:34,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:43:34,789 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:43:34,789 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:43:34,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i [2024-10-11 13:43:36,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:43:36,252 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:43:36,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i [2024-10-11 13:43:36,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/914716d7d/616a8440241e42e3aed61d6e2bebf8ca/FLAGb64663e34 [2024-10-11 13:43:36,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/914716d7d/616a8440241e42e3aed61d6e2bebf8ca [2024-10-11 13:43:36,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:43:36,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:43:36,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:43:36,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:43:36,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:43:36,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:43:36" (1/1) ... [2024-10-11 13:43:36,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c2017d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:36, skipping insertion in model container [2024-10-11 13:43:36,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:43:36" (1/1) ... [2024-10-11 13:43:36,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:43:36,846 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i[915,928] [2024-10-11 13:43:36,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:43:36,885 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:43:36,894 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i[915,928] [2024-10-11 13:43:36,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:43:36,937 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:43:36,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:36 WrapperNode [2024-10-11 13:43:36,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:43:36,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:43:36,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:43:36,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:43:36,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:36" (1/1) ... [2024-10-11 13:43:36,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:36" (1/1) ... [2024-10-11 13:43:36,978 INFO L138 Inliner]: procedures = 29, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 367 [2024-10-11 13:43:36,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:43:36,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:43:36,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:43:36,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:43:36,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:36" (1/1) ... [2024-10-11 13:43:36,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:36" (1/1) ... [2024-10-11 13:43:36,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:36" (1/1) ... [2024-10-11 13:43:37,007 INFO L175 MemorySlicer]: Split 86 memory accesses to 10 slices as follows [2, 10, 18, 6, 3, 3, 14, 8, 14, 8]. 21 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 13 writes are split as follows [0, 4, 1, 1, 1, 1, 1, 1, 2, 1]. [2024-10-11 13:43:37,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:36" (1/1) ... [2024-10-11 13:43:37,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:36" (1/1) ... [2024-10-11 13:43:37,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:36" (1/1) ... [2024-10-11 13:43:37,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:36" (1/1) ... [2024-10-11 13:43:37,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:36" (1/1) ... [2024-10-11 13:43:37,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:36" (1/1) ... [2024-10-11 13:43:37,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:43:37,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:43:37,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:43:37,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:43:37,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:36" (1/1) ... [2024-10-11 13:43:37,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:43:37,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:43:37,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:43:37,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:43:37,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:43:37,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:43:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:43:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:43:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:43:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:43:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:43:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:43:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-11 13:43:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-11 13:43:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-11 13:43:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:43:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:43:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:43:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:43:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:43:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:43:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:43:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 13:43:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 13:43:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 13:43:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:43:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:43:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:43:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:43:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:43:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:43:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:43:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-11 13:43:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-11 13:43:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-11 13:43:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:43:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:43:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:43:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:43:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:43:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:43:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:43:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 13:43:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 13:43:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 13:43:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:43:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:43:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:43:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:43:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:43:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:43:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:43:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-11 13:43:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-11 13:43:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-11 13:43:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:43:37,144 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:43:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:43:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:43:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:43:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:43:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:43:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:43:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:43:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 13:43:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 13:43:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 13:43:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:43:37,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:43:37,276 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:43:37,278 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:43:37,606 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-10-11 13:43:37,606 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:43:37,646 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:43:37,646 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:43:37,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:43:37 BoogieIcfgContainer [2024-10-11 13:43:37,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:43:37,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:43:37,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:43:37,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:43:37,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:43:36" (1/3) ... [2024-10-11 13:43:37,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4376ec6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:43:37, skipping insertion in model container [2024-10-11 13:43:37,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:36" (2/3) ... [2024-10-11 13:43:37,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4376ec6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:43:37, skipping insertion in model container [2024-10-11 13:43:37,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:43:37" (3/3) ... [2024-10-11 13:43:37,657 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-9.i [2024-10-11 13:43:37,676 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:43:37,676 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:43:37,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:43:37,756 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;@3cdb7c50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:43:37,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:43:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 13:43:37,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 13:43:37,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:37,770 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:37,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:37,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:37,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1807529920, now seen corresponding path program 1 times [2024-10-11 13:43:37,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:37,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787978476] [2024-10-11 13:43:37,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:37,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:43:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:43:38,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:38,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787978476] [2024-10-11 13:43:38,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787978476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:38,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:38,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:43:38,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338687389] [2024-10-11 13:43:38,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:38,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:43:38,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:38,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:43:38,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:43:38,147 INFO L87 Difference]: Start difference. First operand has 69 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 13:43:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:38,209 INFO L93 Difference]: Finished difference Result 135 states and 203 transitions. [2024-10-11 13:43:38,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:43:38,212 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-10-11 13:43:38,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:38,219 INFO L225 Difference]: With dead ends: 135 [2024-10-11 13:43:38,220 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 13:43:38,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:43:38,229 INFO L432 NwaCegarLoop]: 91 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, 91 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:38,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:43:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 13:43:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 13:43:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 13:43:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2024-10-11 13:43:38,273 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 57 [2024-10-11 13:43:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:38,273 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2024-10-11 13:43:38,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 13:43:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2024-10-11 13:43:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 13:43:38,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:38,277 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:38,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:43:38,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:38,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:38,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2075036794, now seen corresponding path program 1 times [2024-10-11 13:43:38,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:38,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394456409] [2024-10-11 13:43:38,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:38,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:43:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:43:38,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:38,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394456409] [2024-10-11 13:43:38,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394456409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:38,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:38,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:43:38,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661180349] [2024-10-11 13:43:38,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:38,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:43:38,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:38,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:43:38,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:43:38,488 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:38,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:38,532 INFO L93 Difference]: Finished difference Result 136 states and 193 transitions. [2024-10-11 13:43:38,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:43:38,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-10-11 13:43:38,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:38,535 INFO L225 Difference]: With dead ends: 136 [2024-10-11 13:43:38,535 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 13:43:38,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:43:38,537 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:38,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 257 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:43:38,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 13:43:38,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-10-11 13:43:38,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 13:43:38,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2024-10-11 13:43:38,545 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 57 [2024-10-11 13:43:38,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:38,546 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2024-10-11 13:43:38,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:38,546 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2024-10-11 13:43:38,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 13:43:38,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:38,547 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:38,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:43:38,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:38,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:38,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1826903492, now seen corresponding path program 1 times [2024-10-11 13:43:38,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:38,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271031758] [2024-10-11 13:43:38,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:38,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:43:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:43:38,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:38,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271031758] [2024-10-11 13:43:38,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271031758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:38,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:38,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:43:38,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057070322] [2024-10-11 13:43:38,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:38,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:43:38,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:38,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:43:38,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:43:38,657 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:38,697 INFO L93 Difference]: Finished difference Result 140 states and 197 transitions. [2024-10-11 13:43:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:43:38,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-10-11 13:43:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:38,699 INFO L225 Difference]: With dead ends: 140 [2024-10-11 13:43:38,699 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 13:43:38,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:43:38,700 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:38,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 258 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:43:38,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 13:43:38,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-10-11 13:43:38,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.390625) internal successors, (89), 64 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 13:43:38,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2024-10-11 13:43:38,705 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 57 [2024-10-11 13:43:38,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:38,706 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2024-10-11 13:43:38,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:38,706 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2024-10-11 13:43:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 13:43:38,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:38,707 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:38,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:43:38,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:38,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:38,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1017556866, now seen corresponding path program 1 times [2024-10-11 13:43:38,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:38,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050770642] [2024-10-11 13:43:38,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:38,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:43:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:43:38,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:38,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050770642] [2024-10-11 13:43:38,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050770642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:38,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:38,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:43:38,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952258649] [2024-10-11 13:43:38,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:38,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:43:38,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:38,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:43:38,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:43:38,942 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 13:43:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:39,075 INFO L93 Difference]: Finished difference Result 259 states and 362 transitions. [2024-10-11 13:43:39,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:43:39,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-10-11 13:43:39,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:39,077 INFO L225 Difference]: With dead ends: 259 [2024-10-11 13:43:39,077 INFO L226 Difference]: Without dead ends: 189 [2024-10-11 13:43:39,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:43:39,078 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 306 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:39,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 468 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:43:39,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-11 13:43:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 137. [2024-10-11 13:43:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 124 states have (on average 1.3870967741935485) internal successors, (172), 124 states have internal predecessors, (172), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 13:43:39,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2024-10-11 13:43:39,090 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 192 transitions. Word has length 57 [2024-10-11 13:43:39,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:39,090 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 192 transitions. [2024-10-11 13:43:39,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 13:43:39,090 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 192 transitions. [2024-10-11 13:43:39,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 13:43:39,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:39,092 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:39,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:43:39,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:39,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:39,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1919521351, now seen corresponding path program 1 times [2024-10-11 13:43:39,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:39,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930559944] [2024-10-11 13:43:39,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:39,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:39,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:39,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:39,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:39,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:39,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:43:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:43:39,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:39,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930559944] [2024-10-11 13:43:39,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930559944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:39,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:39,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:43:39,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966740575] [2024-10-11 13:43:39,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:39,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:43:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:39,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:43:39,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:43:39,197 INFO L87 Difference]: Start difference. First operand 137 states and 192 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:39,237 INFO L93 Difference]: Finished difference Result 279 states and 391 transitions. [2024-10-11 13:43:39,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:43:39,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2024-10-11 13:43:39,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:39,243 INFO L225 Difference]: With dead ends: 279 [2024-10-11 13:43:39,243 INFO L226 Difference]: Without dead ends: 143 [2024-10-11 13:43:39,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:43:39,244 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:39,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 260 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:43:39,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-11 13:43:39,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-10-11 13:43:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 128 states have (on average 1.375) internal successors, (176), 128 states have internal predecessors, (176), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 13:43:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 196 transitions. [2024-10-11 13:43:39,262 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 196 transitions. Word has length 58 [2024-10-11 13:43:39,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:39,262 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 196 transitions. [2024-10-11 13:43:39,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 196 transitions. [2024-10-11 13:43:39,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 13:43:39,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:39,264 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:39,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:43:39,264 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:39,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1919461769, now seen corresponding path program 1 times [2024-10-11 13:43:39,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:39,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826450194] [2024-10-11 13:43:39,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:39,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:39,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:39,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:39,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:39,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:39,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:43:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:43:39,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:39,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826450194] [2024-10-11 13:43:39,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826450194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:39,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:39,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:43:39,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954658150] [2024-10-11 13:43:39,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:39,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:43:39,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:39,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:43:39,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:43:39,781 INFO L87 Difference]: Start difference. First operand 141 states and 196 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 13:43:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:39,960 INFO L93 Difference]: Finished difference Result 286 states and 398 transitions. [2024-10-11 13:43:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:43:39,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2024-10-11 13:43:39,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:39,962 INFO L225 Difference]: With dead ends: 286 [2024-10-11 13:43:39,962 INFO L226 Difference]: Without dead ends: 146 [2024-10-11 13:43:39,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:43:39,964 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 141 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:39,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 356 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:43:39,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-11 13:43:39,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-10-11 13:43:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 132 states have (on average 1.3636363636363635) internal successors, (180), 132 states have internal predecessors, (180), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 13:43:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2024-10-11 13:43:39,973 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 58 [2024-10-11 13:43:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:39,973 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2024-10-11 13:43:39,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 13:43:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2024-10-11 13:43:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 13:43:39,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:39,975 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:39,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:43:39,975 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:39,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:39,975 INFO L85 PathProgramCache]: Analyzing trace with hash 111688323, now seen corresponding path program 1 times [2024-10-11 13:43:39,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:39,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899688089] [2024-10-11 13:43:39,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:39,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:40,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:40,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:40,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:40,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:40,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:43:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:43:40,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:40,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899688089] [2024-10-11 13:43:40,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899688089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:40,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:40,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:43:40,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634343119] [2024-10-11 13:43:40,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:40,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:43:40,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:40,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:43:40,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:43:40,088 INFO L87 Difference]: Start difference. First operand 145 states and 200 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:40,169 INFO L93 Difference]: Finished difference Result 360 states and 497 transitions. [2024-10-11 13:43:40,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:43:40,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-10-11 13:43:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:40,171 INFO L225 Difference]: With dead ends: 360 [2024-10-11 13:43:40,171 INFO L226 Difference]: Without dead ends: 216 [2024-10-11 13:43:40,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:43:40,172 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 80 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:40,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 298 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:43:40,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-11 13:43:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 166. [2024-10-11 13:43:40,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 153 states have (on average 1.3725490196078431) internal successors, (210), 153 states have internal predecessors, (210), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 13:43:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 230 transitions. [2024-10-11 13:43:40,193 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 230 transitions. Word has length 62 [2024-10-11 13:43:40,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:40,194 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 230 transitions. [2024-10-11 13:43:40,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:40,194 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2024-10-11 13:43:40,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 13:43:40,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:40,197 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:40,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:43:40,199 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:40,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:40,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1181480751, now seen corresponding path program 1 times [2024-10-11 13:43:40,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:40,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957281902] [2024-10-11 13:43:40,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:40,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:40,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:43:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:40,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:43:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:40,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:43:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:40,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:43:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:40,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:43:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:43:40,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:43:40,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957281902] [2024-10-11 13:43:40,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957281902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:40,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:40,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:43:40,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913496554] [2024-10-11 13:43:40,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:40,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:43:40,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:43:40,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:43:40,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:43:40,357 INFO L87 Difference]: Start difference. First operand 166 states and 230 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:40,476 INFO L93 Difference]: Finished difference Result 398 states and 551 transitions. [2024-10-11 13:43:40,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:43:40,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-10-11 13:43:40,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:40,477 INFO L225 Difference]: With dead ends: 398 [2024-10-11 13:43:40,478 INFO L226 Difference]: Without dead ends: 233 [2024-10-11 13:43:40,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:43:40,479 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 255 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:40,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 386 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:43:40,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-11 13:43:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 156. [2024-10-11 13:43:40,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 13:43:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 215 transitions. [2024-10-11 13:43:40,488 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 215 transitions. Word has length 62 [2024-10-11 13:43:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:40,488 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 215 transitions. [2024-10-11 13:43:40,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 215 transitions. [2024-10-11 13:43:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 13:43:40,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:40,489 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:40,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:43:40,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:40,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:40,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2107460161, now seen corresponding path program 1 times [2024-10-11 13:43:40,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:43:40,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912020949] [2024-10-11 13:43:40,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:40,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:43:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:43:40,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454443541] [2024-10-11 13:43:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:40,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:43:40,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:43:40,536 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:43:40,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:43:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:43:40,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:43:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:43:40,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:43:40,969 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:43:40,970 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:43:40,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:43:41,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:43:41,175 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:41,271 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:43:41,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:43:41 BoogieIcfgContainer [2024-10-11 13:43:41,273 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:43:41,274 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:43:41,274 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:43:41,274 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:43:41,277 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:43:37" (3/4) ... [2024-10-11 13:43:41,279 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:43:41,280 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:43:41,280 INFO L158 Benchmark]: Toolchain (without parser) took 4629.87ms. Allocated memory was 146.8MB in the beginning and 299.9MB in the end (delta: 153.1MB). Free memory was 76.6MB in the beginning and 108.9MB in the end (delta: -32.3MB). Peak memory consumption was 123.2MB. Max. memory is 16.1GB. [2024-10-11 13:43:41,280 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:43:41,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.99ms. Allocated memory was 146.8MB in the beginning and 234.9MB in the end (delta: 88.1MB). Free memory was 76.4MB in the beginning and 201.8MB in the end (delta: -125.4MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-10-11 13:43:41,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.66ms. Allocated memory is still 234.9MB. Free memory was 201.8MB in the beginning and 198.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:43:41,284 INFO L158 Benchmark]: Boogie Preprocessor took 52.62ms. Allocated memory is still 234.9MB. Free memory was 198.7MB in the beginning and 194.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:43:41,284 INFO L158 Benchmark]: RCFGBuilder took 613.90ms. Allocated memory is still 234.9MB. Free memory was 194.5MB in the beginning and 156.8MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 13:43:41,285 INFO L158 Benchmark]: TraceAbstraction took 3624.68ms. Allocated memory was 234.9MB in the beginning and 299.9MB in the end (delta: 65.0MB). Free memory was 156.8MB in the beginning and 108.9MB in the end (delta: 47.9MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. [2024-10-11 13:43:41,285 INFO L158 Benchmark]: Witness Printer took 6.21ms. Allocated memory is still 299.9MB. Free memory is still 108.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:43:41,286 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.15ms. Allocated memory is still 146.8MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.99ms. Allocated memory was 146.8MB in the beginning and 234.9MB in the end (delta: 88.1MB). Free memory was 76.4MB in the beginning and 201.8MB in the end (delta: -125.4MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.66ms. Allocated memory is still 234.9MB. Free memory was 201.8MB in the beginning and 198.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.62ms. Allocated memory is still 234.9MB. Free memory was 198.7MB in the beginning and 194.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 613.90ms. Allocated memory is still 234.9MB. Free memory was 194.5MB in the beginning and 156.8MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3624.68ms. Allocated memory was 234.9MB in the beginning and 299.9MB in the end (delta: 65.0MB). Free memory was 156.8MB in the beginning and 108.9MB in the end (delta: 47.9MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. * Witness Printer took 6.21ms. Allocated memory is still 299.9MB. Free memory is still 108.9MB. 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 someBinaryDOUBLEComparisonOperation at line 90, overapproximation of shiftLeft at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L22] unsigned char var_1_1 = 10; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_3 = 4; [L24] unsigned char var_1_3 = 4; [L25] unsigned char* var_1_3_Pointer = &(var_1_3); [L26] unsigned char var_1_7 = 0; [L26] unsigned char var_1_7 = 0; [L27] unsigned char* var_1_7_Pointer = &(var_1_7); [L28] signed short int var_1_8 = 100; [L28] signed short int var_1_8 = 100; [L29] signed short int* var_1_8_Pointer = &(var_1_8); [L30] unsigned char var_1_9 = 32; [L30] unsigned char var_1_9 = 32; [L31] unsigned char* var_1_9_Pointer = &(var_1_9); [L32] double var_1_10 = 9.2; [L32] double var_1_10 = 9.2; [L33] double* var_1_10_Pointer = &(var_1_10); [L34] double var_1_11 = 0.975; [L34] double var_1_11 = 0.975; [L35] double* var_1_11_Pointer = &(var_1_11); [L36] signed short int var_1_12 = 1; [L36] signed short int var_1_12 = 1; [L37] signed short int* var_1_12_Pointer = &(var_1_12); [L38] signed long int var_1_14 = -16; [L38] signed long int var_1_14 = -16; [L39] signed long int* var_1_14_Pointer = &(var_1_14); [L40] unsigned char last_1_var_1_1 = 10; [L41] double last_1_var_1_10 = 9.2; [L42] signed short int last_1_var_1_12 = 1; [L43] signed long int last_1_var_1_14 = -16; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L84] EXPR \read(var_1_1) [L84] last_1_var_1_1 = var_1_1 [L85] EXPR \read(var_1_10) [L85] last_1_var_1_10 = var_1_10 [L86] EXPR \read(var_1_12) [L86] last_1_var_1_12 = var_1_12 [L87] EXPR \read(var_1_14) [L87] last_1_var_1_14 = var_1_14 [L97] RET updateLastVariables() [L98] CALL updateVariables() [L74] var_1_3 = __VERIFIER_nondet_uchar() [L75] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L75] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L75] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L76] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L76] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L76] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L77] var_1_7 = __VERIFIER_nondet_uchar() [L78] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L78] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L78] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L79] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L80] var_1_11 = __VERIFIER_nondet_double() [L81] EXPR \read(var_1_11) [L81] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L81] EXPR \read(var_1_11) [L81] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L81] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] RET updateVariables() [L99] CALL step() [L47] unsigned char stepLocal_0 = last_1_var_1_10 > last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, stepLocal_0=0, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L48] COND FALSE !(((last_1_var_1_12 + last_1_var_1_1) < 10) || stepLocal_0) [L51] (*(var_1_12_Pointer)) = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L53] EXPR \read(*var_1_12_Pointer) [L53] (*(var_1_14_Pointer)) = (*(var_1_12_Pointer)) [L54] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L54] EXPR 10 << (*(var_1_12_Pointer)) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L54] EXPR \read(*var_1_3_Pointer) [L54] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L54] COND TRUE (10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer))) [L55] EXPR \read(*var_1_12_Pointer) [L55] EXPR \read(*var_1_14_Pointer) [L55] (*(var_1_8_Pointer)) = ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))) [L57] (*(var_1_9_Pointer)) = 64 [L58] EXPR \read(*var_1_11_Pointer) [L58] (*(var_1_10_Pointer)) = (*(var_1_11_Pointer)) [L59] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L59] COND TRUE (*(var_1_12_Pointer)) <= 16 [L60] EXPR \read(*var_1_3_Pointer) [L60] (*(var_1_1_Pointer)) = (*(var_1_3_Pointer)) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR ((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) [L90] EXPR \read(*var_1_1_Pointer) [L90] EXPR \read(*var_1_3_Pointer) [L90] EXPR ((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1) [L90] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR 10 << (*(var_1_12_Pointer)) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR \read(*var_1_3_Pointer) [L90] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR ((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1 [L90] EXPR \read(*var_1_8_Pointer) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR \read(*var_1_14_Pointer) [L90] EXPR ((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR ((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64)) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR ((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64)) [L90] EXPR \read(*var_1_9_Pointer) [L90] EXPR ((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64)) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer)))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer)))) [L90] EXPR \read(*var_1_10_Pointer) [L90] EXPR \read(*var_1_11_Pointer) [L90] EXPR (((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer)))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR ((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR ((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] EXPR (((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90-L91] return (((((((*(var_1_12_Pointer)) <= 16) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : (((((((*(var_1_10_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) < (*(var_1_10_Pointer))) ? ((*(var_1_7_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_3_Pointer)))))) && (((10 << (*(var_1_12_Pointer))) < ((*(var_1_3_Pointer)) * (*(var_1_14_Pointer)))) ? ((*(var_1_8_Pointer)) == ((signed short int) ((*(var_1_12_Pointer)) + (*(var_1_14_Pointer))))) : 1)) && ((*(var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(var_1_10_Pointer)) == ((double) (*(var_1_11_Pointer))))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? ((*(var_1_12_Pointer)) == ((signed short int) (((((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? ((((*(var_1_3_Pointer)) + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : ((*(var_1_12_Pointer)) == ((signed short int) last_1_var_1_12)))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_12_Pointer)))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 785 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 785 mSDsluCounter, 2374 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1721 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 507 IncrementalHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 653 mSDtfsCounter, 507 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=7, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 184 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 594 NumberOfCodeBlocks, 594 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 320/320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:43:41,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:43:43,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:43:43,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:43:43,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:43:43,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:43:43,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:43:43,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:43:43,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:43:43,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:43:43,340 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:43:43,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:43:43,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:43:43,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:43:43,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:43:43,344 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:43:43,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:43:43,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:43:43,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:43:43,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:43:43,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:43:43,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:43:43,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:43:43,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:43:43,349 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:43:43,349 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:43:43,349 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:43:43,349 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:43:43,349 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:43:43,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:43:43,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:43:43,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:43:43,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:43:43,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:43:43,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:43:43,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:43:43,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:43:43,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:43:43,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:43:43,351 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:43:43,351 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:43:43,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:43:43,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:43:43,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:43:43,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:43:43,356 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:43:43,356 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-clean/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-clean/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 -> aa8cc58df8fe09b61997a2de9d9c5e7a83d2492c15b287abd5439e2c29784fc7 [2024-10-11 13:43:43,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:43:43,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:43:43,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:43:43,795 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:43:43,795 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:43:43,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i [2024-10-11 13:43:45,144 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:43:45,315 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:43:45,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i [2024-10-11 13:43:45,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ba494c0e1/ff2e75a87dbc4c129851f51e9f168201/FLAG8ad182892 [2024-10-11 13:43:45,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ba494c0e1/ff2e75a87dbc4c129851f51e9f168201 [2024-10-11 13:43:45,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:43:45,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:43:45,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:43:45,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:43:45,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:43:45,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:43:45" (1/1) ... [2024-10-11 13:43:45,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b62e106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:45, skipping insertion in model container [2024-10-11 13:43:45,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:43:45" (1/1) ... [2024-10-11 13:43:45,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:43:45,529 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i[915,928] [2024-10-11 13:43:45,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:43:45,609 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:43:45,621 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-9.i[915,928] [2024-10-11 13:43:45,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:43:45,677 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:43:45,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:45 WrapperNode [2024-10-11 13:43:45,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:43:45,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:43:45,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:43:45,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:43:45,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:45" (1/1) ... [2024-10-11 13:43:45,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:45" (1/1) ... [2024-10-11 13:43:45,725 INFO L138 Inliner]: procedures = 36, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 353 [2024-10-11 13:43:45,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:43:45,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:43:45,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:43:45,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:43:45,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:45" (1/1) ... [2024-10-11 13:43:45,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:45" (1/1) ... [2024-10-11 13:43:45,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:45" (1/1) ... [2024-10-11 13:43:45,769 INFO L175 MemorySlicer]: Split 86 memory accesses to 10 slices as follows [2, 10, 18, 6, 3, 3, 14, 8, 14, 8]. 21 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 13 writes are split as follows [0, 4, 1, 1, 1, 1, 1, 1, 2, 1]. [2024-10-11 13:43:45,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:45" (1/1) ... [2024-10-11 13:43:45,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:45" (1/1) ... [2024-10-11 13:43:45,794 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:45" (1/1) ... [2024-10-11 13:43:45,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:45" (1/1) ... [2024-10-11 13:43:45,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:45" (1/1) ... [2024-10-11 13:43:45,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:45" (1/1) ... [2024-10-11 13:43:45,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:43:45,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:43:45,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:43:45,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:43:45,823 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:45" (1/1) ... [2024-10-11 13:43:45,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:43:45,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:43:45,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:43:45,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:43:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:43:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:43:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:43:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-11 13:43:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-11 13:43:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-11 13:43:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-11 13:43:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-11 13:43:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-10-11 13:43:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-10-11 13:43:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-10-11 13:43:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:43:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:43:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-11 13:43:45,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-11 13:43:45,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-11 13:43:45,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-11 13:43:45,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-11 13:43:45,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-10-11 13:43:45,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-10-11 13:43:45,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-10-11 13:43:45,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:43:45,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:43:45,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:43:45,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:43:45,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:43:45,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:43:45,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-11 13:43:45,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:43:45,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:43:45,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:43:45,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-11 13:43:45,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-11 13:43:45,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-11 13:43:45,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-11 13:43:45,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-11 13:43:45,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-10-11 13:43:45,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-10-11 13:43:45,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-10-11 13:43:45,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:43:45,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:43:45,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 13:43:45,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 13:43:45,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 13:43:45,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-11 13:43:45,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-11 13:43:45,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-11 13:43:45,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-11 13:43:45,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-11 13:43:45,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:43:45,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:43:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 13:43:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 13:43:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 13:43:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 13:43:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-11 13:43:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-11 13:43:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-11 13:43:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-11 13:43:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:43:45,921 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:43:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:43:45,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:43:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:43:45,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:43:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:43:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:43:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:43:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:43:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-11 13:43:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-11 13:43:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-11 13:43:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-11 13:43:45,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:43:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:43:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 13:43:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 13:43:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 13:43:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 13:43:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-11 13:43:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-11 13:43:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-11 13:43:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-11 13:43:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:43:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:43:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 13:43:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 13:43:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 13:43:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-11 13:43:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-11 13:43:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-11 13:43:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-11 13:43:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-11 13:43:46,122 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:43:46,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:43:46,583 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-10-11 13:43:46,583 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:43:46,639 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:43:46,639 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:43:46,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:43:46 BoogieIcfgContainer [2024-10-11 13:43:46,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:43:46,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:43:46,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:43:46,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:43:46,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:43:45" (1/3) ... [2024-10-11 13:43:46,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b93f322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:43:46, skipping insertion in model container [2024-10-11 13:43:46,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:45" (2/3) ... [2024-10-11 13:43:46,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b93f322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:43:46, skipping insertion in model container [2024-10-11 13:43:46,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:43:46" (3/3) ... [2024-10-11 13:43:46,646 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-9.i [2024-10-11 13:43:46,658 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:43:46,659 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:43:46,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:43:46,715 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;@170007af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:43:46,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:43:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 13:43:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 13:43:46,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:46,727 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:46,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:46,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:46,732 INFO L85 PathProgramCache]: Analyzing trace with hash -269528693, now seen corresponding path program 1 times [2024-10-11 13:43:46,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:43:46,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747908618] [2024-10-11 13:43:46,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:46,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:43:46,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:43:46,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:43:46,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:43:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:47,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:43:47,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:43:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 13:43:47,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:43:47,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:43:47,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747908618] [2024-10-11 13:43:47,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747908618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:47,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:47,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:43:47,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059379228] [2024-10-11 13:43:47,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:47,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:43:47,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:43:47,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:43:47,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:43:47,088 INFO L87 Difference]: Start difference. First operand has 63 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 13:43:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:47,129 INFO L93 Difference]: Finished difference Result 123 states and 187 transitions. [2024-10-11 13:43:47,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:43:47,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-10-11 13:43:47,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:47,137 INFO L225 Difference]: With dead ends: 123 [2024-10-11 13:43:47,138 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 13:43:47,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:43:47,147 INFO L432 NwaCegarLoop]: 83 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, 83 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:47,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:43:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 13:43:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-11 13:43:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 13:43:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2024-10-11 13:43:47,185 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 55 [2024-10-11 13:43:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:47,185 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2024-10-11 13:43:47,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 13:43:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2024-10-11 13:43:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 13:43:47,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:47,188 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:47,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:43:47,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:43:47,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:47,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:47,394 INFO L85 PathProgramCache]: Analyzing trace with hash 838571601, now seen corresponding path program 1 times [2024-10-11 13:43:47,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:43:47,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442396766] [2024-10-11 13:43:47,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:47,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:43:47,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:43:47,397 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:43:47,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:43:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:47,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:43:47,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:43:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:43:47,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:43:47,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:43:47,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442396766] [2024-10-11 13:43:47,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442396766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:47,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:47,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:43:47,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399560409] [2024-10-11 13:43:47,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:47,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:43:47,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:43:47,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:43:47,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:43:47,674 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:47,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:47,735 INFO L93 Difference]: Finished difference Result 124 states and 177 transitions. [2024-10-11 13:43:47,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:43:47,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2024-10-11 13:43:47,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:47,737 INFO L225 Difference]: With dead ends: 124 [2024-10-11 13:43:47,737 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 13:43:47,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:43:47,738 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:47,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 233 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:43:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 13:43:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-10-11 13:43:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 13:43:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2024-10-11 13:43:47,744 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 55 [2024-10-11 13:43:47,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:47,745 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2024-10-11 13:43:47,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:47,746 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2024-10-11 13:43:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 13:43:47,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:47,747 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:47,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 13:43:47,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:43:47,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:47,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash 445544591, now seen corresponding path program 1 times [2024-10-11 13:43:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:43:47,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460425454] [2024-10-11 13:43:47,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:47,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:43:47,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:43:47,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:43:47,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:43:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:48,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:43:48,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:43:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:43:48,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:43:48,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:43:48,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460425454] [2024-10-11 13:43:48,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460425454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:48,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:48,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:43:48,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348286689] [2024-10-11 13:43:48,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:48,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:43:48,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:43:48,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:43:48,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:43:48,184 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:48,239 INFO L93 Difference]: Finished difference Result 128 states and 181 transitions. [2024-10-11 13:43:48,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:43:48,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2024-10-11 13:43:48,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:48,241 INFO L225 Difference]: With dead ends: 128 [2024-10-11 13:43:48,241 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 13:43:48,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:43:48,242 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:48,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 303 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:43:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 13:43:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-11 13:43:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 13:43:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2024-10-11 13:43:48,247 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 55 [2024-10-11 13:43:48,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:48,247 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2024-10-11 13:43:48,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2024-10-11 13:43:48,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 13:43:48,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:48,248 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:48,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:43:48,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:43:48,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:48,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:48,454 INFO L85 PathProgramCache]: Analyzing trace with hash -363802035, now seen corresponding path program 1 times [2024-10-11 13:43:48,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:43:48,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739704601] [2024-10-11 13:43:48,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:48,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:43:48,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:43:48,458 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:43:48,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 13:43:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:48,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:43:48,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:43:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:43:48,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:43:48,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:43:48,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739704601] [2024-10-11 13:43:48,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739704601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:48,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:48,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:43:48,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317328972] [2024-10-11 13:43:48,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:48,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:43:48,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:43:48,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:43:48,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:43:48,695 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:48,755 INFO L93 Difference]: Finished difference Result 134 states and 188 transitions. [2024-10-11 13:43:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:43:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2024-10-11 13:43:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:48,756 INFO L225 Difference]: With dead ends: 134 [2024-10-11 13:43:48,756 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 13:43:48,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:43:48,757 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:48,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:43:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 13:43:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-10-11 13:43:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 13:43:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2024-10-11 13:43:48,771 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 55 [2024-10-11 13:43:48,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:48,772 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2024-10-11 13:43:48,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2024-10-11 13:43:48,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 13:43:48,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:48,788 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:48,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 13:43:48,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:43:48,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:48,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:48,989 INFO L85 PathProgramCache]: Analyzing trace with hash -363742453, now seen corresponding path program 1 times [2024-10-11 13:43:48,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:43:48,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245373478] [2024-10-11 13:43:48,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:48,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:43:48,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:43:48,998 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:43:49,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 13:43:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:49,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:43:49,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:43:49,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-11 13:43:49,260 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 54 treesize of output 42 [2024-10-11 13:43:49,266 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 42 treesize of output 30 [2024-10-11 13:43:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:43:49,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:43:49,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:43:49,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245373478] [2024-10-11 13:43:49,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245373478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:49,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:49,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:43:49,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980631928] [2024-10-11 13:43:49,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:49,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:43:49,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:43:49,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:43:49,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:43:49,294 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:49,492 INFO L93 Difference]: Finished difference Result 140 states and 193 transitions. [2024-10-11 13:43:49,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:43:49,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2024-10-11 13:43:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:49,493 INFO L225 Difference]: With dead ends: 140 [2024-10-11 13:43:49,494 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 13:43:49,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:43:49,495 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 130 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:49,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 220 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:43:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 13:43:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-10-11 13:43:49,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.359375) internal successors, (87), 64 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 13:43:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2024-10-11 13:43:49,503 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 55 [2024-10-11 13:43:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:49,507 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2024-10-11 13:43:49,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2024-10-11 13:43:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 13:43:49,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:49,508 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:49,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:43:49,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:43:49,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:49,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:49,710 INFO L85 PathProgramCache]: Analyzing trace with hash -2121878124, now seen corresponding path program 1 times [2024-10-11 13:43:49,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:43:49,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906595695] [2024-10-11 13:43:49,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:49,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:43:49,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:43:49,714 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:43:49,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 13:43:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:50,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 13:43:50,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:43:50,668 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 18 treesize of output 19 [2024-10-11 13:43:51,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:43:51,023 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 188 treesize of output 118 [2024-10-11 13:43:51,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:43:51,032 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 255 treesize of output 135 [2024-10-11 13:43:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 13:43:51,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:43:51,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:43:51,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906595695] [2024-10-11 13:43:51,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906595695] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:43:51,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1701533511] [2024-10-11 13:43:51,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:51,277 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:43:51,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:43:51,280 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:43:51,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-11 13:43:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:52,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 13:43:52,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:43:52,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-10-11 13:43:53,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-11 13:43:53,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:43:53,771 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 174 treesize of output 118 [2024-10-11 13:43:53,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 139 [2024-10-11 13:43:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 13:43:53,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:43:53,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1701533511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:43:53,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:43:53,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-10-11 13:43:53,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547647807] [2024-10-11 13:43:53,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:43:53,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 13:43:53,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:43:53,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 13:43:53,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:43:53,941 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 13:43:55,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:55,458 INFO L93 Difference]: Finished difference Result 212 states and 287 transitions. [2024-10-11 13:43:55,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:43:55,460 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 57 [2024-10-11 13:43:55,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:55,461 INFO L225 Difference]: With dead ends: 212 [2024-10-11 13:43:55,461 INFO L226 Difference]: Without dead ends: 142 [2024-10-11 13:43:55,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-10-11 13:43:55,462 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 190 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:55,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 715 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 13:43:55,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-11 13:43:55,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-10-11 13:43:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 125 states have (on average 1.344) internal successors, (168), 126 states have internal predecessors, (168), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 13:43:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 188 transitions. [2024-10-11 13:43:55,476 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 188 transitions. Word has length 57 [2024-10-11 13:43:55,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:55,477 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 188 transitions. [2024-10-11 13:43:55,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 13:43:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 188 transitions. [2024-10-11 13:43:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 13:43:55,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:55,478 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:55,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:43:55,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-10-11 13:43:55,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:43:55,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:55,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:55,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1363742546, now seen corresponding path program 1 times [2024-10-11 13:43:55,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:43:55,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326453041] [2024-10-11 13:43:55,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:55,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-10-11 13:43:55,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:43:55,890 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:43:55,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 13:43:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:56,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:43:56,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:43:56,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:43:56,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-10-11 13:43:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:43:56,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:43:56,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:43:56,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326453041] [2024-10-11 13:43:56,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326453041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:56,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:56,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:43:56,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491808733] [2024-10-11 13:43:56,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:56,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:43:56,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:43:56,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:43:56,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:43:56,193 INFO L87 Difference]: Start difference. First operand 139 states and 188 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:56,264 INFO L93 Difference]: Finished difference Result 317 states and 429 transitions. [2024-10-11 13:43:56,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:43:56,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-10-11 13:43:56,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:56,268 INFO L225 Difference]: With dead ends: 317 [2024-10-11 13:43:56,268 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 13:43:56,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 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-10-11 13:43:56,269 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 78 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:56,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 366 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:43:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 13:43:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 139. [2024-10-11 13:43:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 125 states have (on average 1.328) internal successors, (166), 126 states have internal predecessors, (166), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 13:43:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 186 transitions. [2024-10-11 13:43:56,284 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 186 transitions. Word has length 57 [2024-10-11 13:43:56,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:56,284 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 186 transitions. [2024-10-11 13:43:56,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 186 transitions. [2024-10-11 13:43:56,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 13:43:56,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:56,285 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:56,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:43:56,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:43:56,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:56,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:56,487 INFO L85 PathProgramCache]: Analyzing trace with hash 970715536, now seen corresponding path program 1 times [2024-10-11 13:43:56,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:43:56,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649157034] [2024-10-11 13:43:56,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:56,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:43:56,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:43:56,490 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:43:56,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:43:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:56,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 13:43:56,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:43:56,949 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2024-10-11 13:43:56,950 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 1 case distinctions, treesize of input 26 treesize of output 21 [2024-10-11 13:43:56,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-11 13:43:56,992 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 25 treesize of output 21 [2024-10-11 13:43:57,103 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 91 treesize of output 75 [2024-10-11 13:43:57,112 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 13:43:57,113 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 84 treesize of output 64 [2024-10-11 13:43:57,116 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 63 treesize of output 51 [2024-10-11 13:43:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:43:57,149 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:43:57,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:43:57,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649157034] [2024-10-11 13:43:57,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649157034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:57,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:57,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:43:57,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523043118] [2024-10-11 13:43:57,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:57,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:43:57,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:43:57,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:43:57,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:43:57,150 INFO L87 Difference]: Start difference. First operand 139 states and 186 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:43:58,086 INFO L93 Difference]: Finished difference Result 601 states and 805 transitions. [2024-10-11 13:43:58,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:43:58,087 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-10-11 13:43:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:43:58,089 INFO L225 Difference]: With dead ends: 601 [2024-10-11 13:43:58,089 INFO L226 Difference]: Without dead ends: 463 [2024-10-11 13:43:58,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:43:58,090 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 464 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:43:58,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 788 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:43:58,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-11 13:43:58,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 415. [2024-10-11 13:43:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 375 states have (on average 1.312) internal successors, (492), 378 states have internal predecessors, (492), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 13:43:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 552 transitions. [2024-10-11 13:43:58,123 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 552 transitions. Word has length 57 [2024-10-11 13:43:58,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:43:58,124 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 552 transitions. [2024-10-11 13:43:58,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:43:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 552 transitions. [2024-10-11 13:43:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 13:43:58,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:43:58,125 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:43:58,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:43:58,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:43:58,326 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:43:58,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:43:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash 153067086, now seen corresponding path program 1 times [2024-10-11 13:43:58,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:43:58,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989503452] [2024-10-11 13:43:58,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:43:58,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:43:58,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:43:58,328 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:43:58,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 13:43:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:43:58,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 13:43:58,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:43:58,725 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2024-10-11 13:43:58,725 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 1 case distinctions, treesize of input 26 treesize of output 21 [2024-10-11 13:43:58,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-11 13:43:59,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2024-10-11 13:43:59,142 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 29 treesize of output 21 [2024-10-11 13:43:59,157 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 13:43:59,157 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 55 treesize of output 31 [2024-10-11 13:43:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:43:59,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:43:59,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:43:59,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989503452] [2024-10-11 13:43:59,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989503452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:43:59,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:43:59,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:43:59,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813465372] [2024-10-11 13:43:59,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:43:59,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:43:59,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:43:59,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:43:59,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:43:59,190 INFO L87 Difference]: Start difference. First operand 415 states and 552 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:44:00,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:00,507 INFO L93 Difference]: Finished difference Result 920 states and 1221 transitions. [2024-10-11 13:44:00,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:44:00,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-10-11 13:44:00,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:00,509 INFO L225 Difference]: With dead ends: 920 [2024-10-11 13:44:00,509 INFO L226 Difference]: Without dead ends: 506 [2024-10-11 13:44:00,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:44:00,510 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 253 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:00,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 502 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 13:44:00,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-10-11 13:44:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 315. [2024-10-11 13:44:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 288 states have (on average 1.3333333333333333) internal successors, (384), 290 states have internal predecessors, (384), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:44:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 424 transitions. [2024-10-11 13:44:00,541 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 424 transitions. Word has length 57 [2024-10-11 13:44:00,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:00,542 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 424 transitions. [2024-10-11 13:44:00,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:44:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 424 transitions. [2024-10-11 13:44:00,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 13:44:00,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:00,543 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:44:00,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 13:44:00,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:00,744 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:00,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:00,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1420278250, now seen corresponding path program 1 times [2024-10-11 13:44:00,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:00,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256491566] [2024-10-11 13:44:00,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:00,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:00,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:00,748 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:44:00,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:44:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:00,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:44:00,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 13:44:00,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:44:00,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:00,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256491566] [2024-10-11 13:44:00,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256491566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:00,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:00,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:44:00,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606578797] [2024-10-11 13:44:00,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:00,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:44:00,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:00,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:44:00,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:44:00,929 INFO L87 Difference]: Start difference. First operand 315 states and 424 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 13:44:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:01,020 INFO L93 Difference]: Finished difference Result 629 states and 847 transitions. [2024-10-11 13:44:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:44:01,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-10-11 13:44:01,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:01,024 INFO L225 Difference]: With dead ends: 629 [2024-10-11 13:44:01,024 INFO L226 Difference]: Without dead ends: 315 [2024-10-11 13:44:01,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:44:01,025 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:01,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:44:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-11 13:44:01,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2024-10-11 13:44:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 288 states have (on average 1.3263888888888888) internal successors, (382), 290 states have internal predecessors, (382), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:44:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 422 transitions. [2024-10-11 13:44:01,066 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 422 transitions. Word has length 57 [2024-10-11 13:44:01,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:01,066 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 422 transitions. [2024-10-11 13:44:01,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 13:44:01,066 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 422 transitions. [2024-10-11 13:44:01,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 13:44:01,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:01,067 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:44:01,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:44:01,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:01,272 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:01,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:01,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1836731428, now seen corresponding path program 1 times [2024-10-11 13:44:01,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:01,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17917900] [2024-10-11 13:44:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:01,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:01,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:01,275 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:44:01,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 13:44:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:01,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:44:01,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:01,680 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2024-10-11 13:44:01,681 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 1 case distinctions, treesize of input 26 treesize of output 21 [2024-10-11 13:44:01,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-11 13:44:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:44:01,868 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:44:01,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:01,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17917900] [2024-10-11 13:44:01,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17917900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:01,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:01,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:44:01,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808299541] [2024-10-11 13:44:01,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:01,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:44:01,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:01,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:44:01,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:44:01,870 INFO L87 Difference]: Start difference. First operand 315 states and 422 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:44:02,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:02,357 INFO L93 Difference]: Finished difference Result 363 states and 483 transitions. [2024-10-11 13:44:02,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:44:02,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2024-10-11 13:44:02,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:02,360 INFO L225 Difference]: With dead ends: 363 [2024-10-11 13:44:02,360 INFO L226 Difference]: Without dead ends: 361 [2024-10-11 13:44:02,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:44:02,361 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 254 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:02,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 495 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:44:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-11 13:44:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 319. [2024-10-11 13:44:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 292 states have (on average 1.321917808219178) internal successors, (386), 294 states have internal predecessors, (386), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:44:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 426 transitions. [2024-10-11 13:44:02,399 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 426 transitions. Word has length 59 [2024-10-11 13:44:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:02,400 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 426 transitions. [2024-10-11 13:44:02,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:44:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 426 transitions. [2024-10-11 13:44:02,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 13:44:02,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:02,401 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:44:02,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 13:44:02,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:02,601 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:02,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1836791010, now seen corresponding path program 1 times [2024-10-11 13:44:02,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:02,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371877542] [2024-10-11 13:44:02,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:02,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:02,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:02,605 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:44:02,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 13:44:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:02,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:44:02,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:03,026 INFO L349 Elim1Store]: treesize reduction 26, result has 21.2 percent of original size [2024-10-11 13:44:03,027 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 1 case distinctions, treesize of input 29 treesize of output 24 [2024-10-11 13:44:03,193 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 13:44:03,194 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 62 treesize of output 34 [2024-10-11 13:44:03,216 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:44:03,216 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:44:03,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:03,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371877542] [2024-10-11 13:44:03,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371877542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:03,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:03,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:44:03,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209100870] [2024-10-11 13:44:03,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:03,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:44:03,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:03,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:44:03,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:44:03,218 INFO L87 Difference]: Start difference. First operand 319 states and 426 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:44:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:03,542 INFO L93 Difference]: Finished difference Result 649 states and 866 transitions. [2024-10-11 13:44:03,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:44:03,543 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2024-10-11 13:44:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:03,544 INFO L225 Difference]: With dead ends: 649 [2024-10-11 13:44:03,544 INFO L226 Difference]: Without dead ends: 331 [2024-10-11 13:44:03,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:44:03,546 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 186 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:03,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 394 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:44:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-11 13:44:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 325. [2024-10-11 13:44:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 298 states have (on average 1.3154362416107384) internal successors, (392), 300 states have internal predecessors, (392), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:44:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 432 transitions. [2024-10-11 13:44:03,574 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 432 transitions. Word has length 59 [2024-10-11 13:44:03,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:03,575 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 432 transitions. [2024-10-11 13:44:03,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:44:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 432 transitions. [2024-10-11 13:44:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 13:44:03,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:03,576 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:44:03,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 13:44:03,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:03,777 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:03,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:03,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1646055485, now seen corresponding path program 1 times [2024-10-11 13:44:03,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:03,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104529630] [2024-10-11 13:44:03,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:03,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:03,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:03,780 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:44:03,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 13:44:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:03,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:44:03,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:04,134 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2024-10-11 13:44:04,135 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 1 case distinctions, treesize of input 26 treesize of output 21 [2024-10-11 13:44:04,175 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 13:44:04,175 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 30 treesize of output 14 [2024-10-11 13:44:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:44:04,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:44:04,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:04,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104529630] [2024-10-11 13:44:04,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104529630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:04,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:04,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:44:04,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752876127] [2024-10-11 13:44:04,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:04,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:44:04,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:04,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:44:04,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:44:04,190 INFO L87 Difference]: Start difference. First operand 325 states and 432 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:44:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:04,482 INFO L93 Difference]: Finished difference Result 609 states and 808 transitions. [2024-10-11 13:44:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:44:04,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2024-10-11 13:44:04,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:04,486 INFO L225 Difference]: With dead ends: 609 [2024-10-11 13:44:04,486 INFO L226 Difference]: Without dead ends: 285 [2024-10-11 13:44:04,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:44:04,487 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 167 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:04,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 350 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:44:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-11 13:44:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 279. [2024-10-11 13:44:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 252 states have (on average 1.2936507936507937) internal successors, (326), 254 states have internal predecessors, (326), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:44:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 366 transitions. [2024-10-11 13:44:04,516 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 366 transitions. Word has length 59 [2024-10-11 13:44:04,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:04,516 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 366 transitions. [2024-10-11 13:44:04,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:44:04,517 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 366 transitions. [2024-10-11 13:44:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 13:44:04,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:04,517 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:44:04,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-11 13:44:04,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:04,718 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:04,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash 687867349, now seen corresponding path program 1 times [2024-10-11 13:44:04,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:04,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048969187] [2024-10-11 13:44:04,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:04,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:04,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:04,721 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:44:04,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 13:44:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:04,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:44:04,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:04,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:44:04,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:44:05,033 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 13:44:05,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:44:05,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:05,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048969187] [2024-10-11 13:44:05,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048969187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:05,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:05,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:44:05,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543412794] [2024-10-11 13:44:05,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:05,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:44:05,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:05,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:44:05,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:44:05,035 INFO L87 Difference]: Start difference. First operand 279 states and 366 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:44:05,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:05,252 INFO L93 Difference]: Finished difference Result 671 states and 877 transitions. [2024-10-11 13:44:05,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:44:05,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2024-10-11 13:44:05,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:05,254 INFO L225 Difference]: With dead ends: 671 [2024-10-11 13:44:05,254 INFO L226 Difference]: Without dead ends: 393 [2024-10-11 13:44:05,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:44:05,255 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 69 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:05,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 270 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:44:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-11 13:44:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 373. [2024-10-11 13:44:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 338 states have (on average 1.2899408284023668) internal successors, (436), 340 states have internal predecessors, (436), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:44:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 488 transitions. [2024-10-11 13:44:05,290 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 488 transitions. Word has length 59 [2024-10-11 13:44:05,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:05,291 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 488 transitions. [2024-10-11 13:44:05,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:44:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 488 transitions. [2024-10-11 13:44:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 13:44:05,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:05,292 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:44:05,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-11 13:44:05,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:05,492 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:05,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1377437800, now seen corresponding path program 1 times [2024-10-11 13:44:05,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:05,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722735532] [2024-10-11 13:44:05,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:05,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:05,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:05,495 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:44:05,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 13:44:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:05,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:44:05,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 13:44:05,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:44:05,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:05,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722735532] [2024-10-11 13:44:05,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722735532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:44:05,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:44:05,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:44:05,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310314688] [2024-10-11 13:44:05,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:05,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:44:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:05,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:44:05,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:44:05,691 INFO L87 Difference]: Start difference. First operand 373 states and 488 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 13:44:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:05,840 INFO L93 Difference]: Finished difference Result 701 states and 917 transitions. [2024-10-11 13:44:05,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:44:05,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-11 13:44:05,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:05,842 INFO L225 Difference]: With dead ends: 701 [2024-10-11 13:44:05,842 INFO L226 Difference]: Without dead ends: 383 [2024-10-11 13:44:05,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:44:05,843 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:05,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 361 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:44:05,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-11 13:44:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 373. [2024-10-11 13:44:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 338 states have (on average 1.2810650887573964) internal successors, (433), 340 states have internal predecessors, (433), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:44:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 485 transitions. [2024-10-11 13:44:05,879 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 485 transitions. Word has length 59 [2024-10-11 13:44:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:05,880 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 485 transitions. [2024-10-11 13:44:05,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 13:44:05,880 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 485 transitions. [2024-10-11 13:44:05,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 13:44:05,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:05,880 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:44:05,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:44:06,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:06,085 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:06,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:06,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1400070054, now seen corresponding path program 1 times [2024-10-11 13:44:06,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:06,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121478026] [2024-10-11 13:44:06,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:06,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:06,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:06,089 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:44:06,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 13:44:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:06,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 13:44:06,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:06,925 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 18 treesize of output 19 [2024-10-11 13:44:07,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:44:07,228 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 188 treesize of output 118 [2024-10-11 13:44:07,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:44:07,235 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 253 treesize of output 133 [2024-10-11 13:44:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 13:44:07,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:07,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:07,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121478026] [2024-10-11 13:44:07,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121478026] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:44:07,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1311647883] [2024-10-11 13:44:07,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:07,497 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:44:07,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:44:07,499 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:44:07,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-10-11 13:44:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:08,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 13:44:08,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:08,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-10-11 13:44:13,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-11 13:44:14,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:44:14,132 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 174 treesize of output 118 [2024-10-11 13:44:14,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 137 [2024-10-11 13:44:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 13:44:14,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:14,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1311647883] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:44:14,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:44:14,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2024-10-11 13:44:14,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736755974] [2024-10-11 13:44:14,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:44:14,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 13:44:14,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:14,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 13:44:14,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=531, Unknown=1, NotChecked=0, Total=650 [2024-10-11 13:44:14,270 INFO L87 Difference]: Start difference. First operand 373 states and 485 transitions. Second operand has 23 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 20 states have internal predecessors, (73), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 13:44:16,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:16,515 INFO L93 Difference]: Finished difference Result 671 states and 864 transitions. [2024-10-11 13:44:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 13:44:16,516 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 20 states have internal predecessors, (73), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 59 [2024-10-11 13:44:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:16,517 INFO L225 Difference]: With dead ends: 671 [2024-10-11 13:44:16,517 INFO L226 Difference]: Without dead ends: 393 [2024-10-11 13:44:16,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=378, Invalid=1343, Unknown=1, NotChecked=0, Total=1722 [2024-10-11 13:44:16,519 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 246 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:16,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 999 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 13:44:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-11 13:44:16,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 211. [2024-10-11 13:44:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 189 states have (on average 1.2592592592592593) internal successors, (238), 189 states have internal predecessors, (238), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:44:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 268 transitions. [2024-10-11 13:44:16,559 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 268 transitions. Word has length 59 [2024-10-11 13:44:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:16,559 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 268 transitions. [2024-10-11 13:44:16,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 20 states have internal predecessors, (73), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 13:44:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 268 transitions. [2024-10-11 13:44:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:44:16,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:16,560 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:44:16,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2024-10-11 13:44:16,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:44:16,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:16,965 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:16,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:16,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1550459167, now seen corresponding path program 1 times [2024-10-11 13:44:16,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:16,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325455734] [2024-10-11 13:44:16,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:16,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:16,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:16,967 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:44:16,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:44:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:17,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 13:44:17,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:17,819 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 14 [2024-10-11 13:44:17,955 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 66 treesize of output 54 [2024-10-11 13:44:18,288 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 38 treesize of output 22 [2024-10-11 13:44:18,292 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 20 treesize of output 12 [2024-10-11 13:44:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 20 proven. 115 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-11 13:44:18,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:18,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:44:18,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2024-10-11 13:44:19,293 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 115 treesize of output 99 [2024-10-11 13:44:20,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:20,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325455734] [2024-10-11 13:44:20,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325455734] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:44:20,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1885027654] [2024-10-11 13:44:20,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:20,385 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:44:20,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:44:20,388 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:44:20,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-10-11 13:44:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:21,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 13:44:21,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:24,148 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 14 [2024-10-11 13:44:24,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-11 13:44:24,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-11 13:44:24,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2024-10-11 13:44:26,522 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 18 treesize of output 10 [2024-10-11 13:44:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 23 proven. 140 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 13:44:29,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:30,463 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2024-10-11 13:44:30,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1885027654] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:44:30,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:44:30,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 13] total 29 [2024-10-11 13:44:30,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959811337] [2024-10-11 13:44:30,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:44:30,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:44:30,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:30,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:44:30,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1260, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 13:44:30,465 INFO L87 Difference]: Start difference. First operand 211 states and 268 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:44:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:31,036 INFO L93 Difference]: Finished difference Result 423 states and 533 transitions. [2024-10-11 13:44:31,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:44:31,037 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 117 [2024-10-11 13:44:31,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:31,039 INFO L225 Difference]: With dead ends: 423 [2024-10-11 13:44:31,039 INFO L226 Difference]: Without dead ends: 344 [2024-10-11 13:44:31,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 395 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=164, Invalid=1476, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 13:44:31,040 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 76 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:31,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 600 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:44:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-11 13:44:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 230. [2024-10-11 13:44:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 208 states have (on average 1.2836538461538463) internal successors, (267), 208 states have internal predecessors, (267), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:44:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 297 transitions. [2024-10-11 13:44:31,070 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 297 transitions. Word has length 117 [2024-10-11 13:44:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:31,071 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 297 transitions. [2024-10-11 13:44:31,071 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:44:31,071 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 297 transitions. [2024-10-11 13:44:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:44:31,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:31,072 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:44:31,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:44:31,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2024-10-11 13:44:31,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:44:31,476 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:31,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:31,477 INFO L85 PathProgramCache]: Analyzing trace with hash 732810717, now seen corresponding path program 1 times [2024-10-11 13:44:31,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:31,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930085268] [2024-10-11 13:44:31,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:31,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:31,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:31,480 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:44:31,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (22)] Waiting until timeout for monitored process [2024-10-11 13:44:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:31,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 13:44:31,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:32,321 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 14 [2024-10-11 13:44:32,451 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 66 treesize of output 54 [2024-10-11 13:44:32,769 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 38 treesize of output 22 [2024-10-11 13:44:32,775 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 20 treesize of output 12 [2024-10-11 13:44:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 20 proven. 115 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-11 13:44:33,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:33,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:44:33,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2024-10-11 13:44:33,788 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 115 treesize of output 99 [2024-10-11 13:44:34,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:34,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930085268] [2024-10-11 13:44:34,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930085268] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:44:34,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [321713929] [2024-10-11 13:44:34,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:34,838 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:44:34,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:44:34,841 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:44:34,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-10-11 13:44:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:35,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 13:44:35,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:37,398 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 14 [2024-10-11 13:44:37,814 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 43 treesize of output 35 [2024-10-11 13:44:37,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 13:44:38,266 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 18 treesize of output 10 [2024-10-11 13:44:38,268 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 38 treesize of output 22 [2024-10-11 13:44:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 20 proven. 115 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-11 13:44:38,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:38,681 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 56 treesize of output 52 [2024-10-11 13:44:38,853 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 115 treesize of output 99 [2024-10-11 13:44:39,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [321713929] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:44:39,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:44:39,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2024-10-11 13:44:39,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137121470] [2024-10-11 13:44:39,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:44:39,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 13:44:39,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:39,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 13:44:39,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2024-10-11 13:44:39,404 INFO L87 Difference]: Start difference. First operand 230 states and 297 transitions. Second operand has 16 states, 16 states have (on average 6.9375) internal successors, (111), 15 states have internal predecessors, (111), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 13:44:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:44:41,725 INFO L93 Difference]: Finished difference Result 516 states and 656 transitions. [2024-10-11 13:44:41,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:44:41,725 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 15 states have internal predecessors, (111), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 117 [2024-10-11 13:44:41,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:44:41,732 INFO L225 Difference]: With dead ends: 516 [2024-10-11 13:44:41,733 INFO L226 Difference]: Without dead ends: 346 [2024-10-11 13:44:41,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 372 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 13:44:41,734 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 342 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:44:41,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 867 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 13:44:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-11 13:44:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 259. [2024-10-11 13:44:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 237 states have internal predecessors, (300), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:44:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 330 transitions. [2024-10-11 13:44:41,789 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 330 transitions. Word has length 117 [2024-10-11 13:44:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:44:41,790 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 330 transitions. [2024-10-11 13:44:41,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 15 states have internal predecessors, (111), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 13:44:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 330 transitions. [2024-10-11 13:44:41,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:44:41,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:44:41,791 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:44:41,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-10-11 13:44:42,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (22)] Forceful destruction successful, exit code 0 [2024-10-11 13:44:42,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:42,199 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:44:42,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:44:42,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1974232989, now seen corresponding path program 1 times [2024-10-11 13:44:42,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:44:42,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712523856] [2024-10-11 13:44:42,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:42,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:44:42,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:44:42,201 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:44:42,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (24)] Waiting until timeout for monitored process [2024-10-11 13:44:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:42,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 13:44:42,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:43,327 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 14 [2024-10-11 13:44:43,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-11 13:44:44,524 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 83 treesize of output 55 [2024-10-11 13:44:44,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-10-11 13:44:44,785 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 21 treesize of output 13 [2024-10-11 13:44:44,789 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 52 treesize of output 36 [2024-10-11 13:44:44,791 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 97 treesize of output 77 [2024-10-11 13:44:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 15 proven. 148 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 13:44:44,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:50,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:44:50,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712523856] [2024-10-11 13:44:50,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712523856] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:44:50,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1409785759] [2024-10-11 13:44:50,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:44:50,124 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:44:50,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:44:50,125 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:44:50,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-10-11 13:44:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:44:51,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 13:44:51,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:44:52,339 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 14 [2024-10-11 13:44:52,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-11 13:44:54,641 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 78 treesize of output 50 [2024-10-11 13:44:54,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-10-11 13:44:56,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2024-10-11 13:44:56,135 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 52 treesize of output 36 [2024-10-11 13:44:56,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-10-11 13:44:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 12 proven. 123 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-11 13:44:56,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:44:56,754 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 66 treesize of output 54 [2024-10-11 13:44:58,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1409785759] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:44:58,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:44:58,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 27 [2024-10-11 13:44:58,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371038430] [2024-10-11 13:44:58,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:44:58,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 13:44:58,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:44:58,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 13:44:58,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1184, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 13:44:58,218 INFO L87 Difference]: Start difference. First operand 259 states and 330 transitions. Second operand has 28 states, 27 states have (on average 5.185185185185185) internal successors, (140), 26 states have internal predecessors, (140), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2024-10-11 13:45:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:03,159 INFO L93 Difference]: Finished difference Result 582 states and 738 transitions. [2024-10-11 13:45:03,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 13:45:03,160 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 5.185185185185185) internal successors, (140), 26 states have internal predecessors, (140), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 117 [2024-10-11 13:45:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:03,161 INFO L225 Difference]: With dead ends: 582 [2024-10-11 13:45:03,161 INFO L226 Difference]: Without dead ends: 484 [2024-10-11 13:45:03,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=457, Invalid=2623, Unknown=0, NotChecked=0, Total=3080 [2024-10-11 13:45:03,162 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 575 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:03,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1753 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 13:45:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-11 13:45:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 300. [2024-10-11 13:45:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 271 states have (on average 1.2656826568265682) internal successors, (343), 272 states have internal predecessors, (343), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:45:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 381 transitions. [2024-10-11 13:45:03,217 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 381 transitions. Word has length 117 [2024-10-11 13:45:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:03,217 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 381 transitions. [2024-10-11 13:45:03,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 5.185185185185185) internal successors, (140), 26 states have internal predecessors, (140), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2024-10-11 13:45:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 381 transitions. [2024-10-11 13:45:03,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:45:03,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:03,219 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:45:03,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-10-11 13:45:03,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (24)] Ended with exit code 0 [2024-10-11 13:45:03,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,24 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:45:03,623 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:03,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:03,623 INFO L85 PathProgramCache]: Analyzing trace with hash 168794655, now seen corresponding path program 1 times [2024-10-11 13:45:03,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:03,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497773634] [2024-10-11 13:45:03,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:03,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:45:03,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:03,625 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:45:03,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (26)] Waiting until timeout for monitored process [2024-10-11 13:45:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:03,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 13:45:03,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:04,976 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 14 [2024-10-11 13:45:05,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-11 13:45:06,188 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 122 treesize of output 90 [2024-10-11 13:45:06,287 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 112 treesize of output 100 [2024-10-11 13:45:06,683 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 21 treesize of output 13 [2024-10-11 13:45:06,687 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 92 treesize of output 80 [2024-10-11 13:45:06,690 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 93 treesize of output 77 [2024-10-11 13:45:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 12 proven. 123 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-11 13:45:06,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:45:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-10-11 13:45:07,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:07,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497773634] [2024-10-11 13:45:07,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497773634] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:45:07,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:45:07,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2024-10-11 13:45:07,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049164421] [2024-10-11 13:45:07,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:07,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:45:07,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:07,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:45:07,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:45:07,474 INFO L87 Difference]: Start difference. First operand 300 states and 381 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:45:08,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:08,129 INFO L93 Difference]: Finished difference Result 435 states and 555 transitions. [2024-10-11 13:45:08,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:45:08,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 117 [2024-10-11 13:45:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:08,133 INFO L225 Difference]: With dead ends: 435 [2024-10-11 13:45:08,133 INFO L226 Difference]: Without dead ends: 337 [2024-10-11 13:45:08,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:45:08,134 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 45 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:08,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 338 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:45:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-11 13:45:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 282. [2024-10-11 13:45:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 253 states have (on average 1.2529644268774704) internal successors, (317), 254 states have internal predecessors, (317), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:45:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 355 transitions. [2024-10-11 13:45:08,189 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 355 transitions. Word has length 117 [2024-10-11 13:45:08,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:08,190 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 355 transitions. [2024-10-11 13:45:08,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:45:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 355 transitions. [2024-10-11 13:45:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:45:08,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:08,192 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:45:08,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (26)] Ended with exit code 0 [2024-10-11 13:45:08,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:45:08,397 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:08,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:08,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1825456985, now seen corresponding path program 1 times [2024-10-11 13:45:08,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:08,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551199184] [2024-10-11 13:45:08,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:08,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:45:08,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:08,399 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:45:08,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (27)] Waiting until timeout for monitored process [2024-10-11 13:45:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:08,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 13:45:08,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-11 13:45:08,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:45:08,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:08,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551199184] [2024-10-11 13:45:08,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551199184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:45:08,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:45:08,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:45:08,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751229605] [2024-10-11 13:45:08,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:08,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:45:08,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:08,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:45:08,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:45:08,862 INFO L87 Difference]: Start difference. First operand 282 states and 355 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:45:08,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:08,976 INFO L93 Difference]: Finished difference Result 602 states and 761 transitions. [2024-10-11 13:45:08,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:45:08,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 119 [2024-10-11 13:45:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:08,978 INFO L225 Difference]: With dead ends: 602 [2024-10-11 13:45:08,978 INFO L226 Difference]: Without dead ends: 333 [2024-10-11 13:45:08,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:45:08,980 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 34 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:08,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 169 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:45:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-11 13:45:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 276. [2024-10-11 13:45:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 247 states have (on average 1.2672064777327936) internal successors, (313), 248 states have internal predecessors, (313), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:45:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 351 transitions. [2024-10-11 13:45:09,051 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 351 transitions. Word has length 119 [2024-10-11 13:45:09,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:09,051 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 351 transitions. [2024-10-11 13:45:09,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:45:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 351 transitions. [2024-10-11 13:45:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:45:09,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:09,053 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:45:09,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (27)] Ended with exit code 0 [2024-10-11 13:45:09,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:45:09,258 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:09,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:09,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1649356235, now seen corresponding path program 1 times [2024-10-11 13:45:09,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:09,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398322277] [2024-10-11 13:45:09,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:09,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:45:09,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:09,261 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:45:09,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (28)] Waiting until timeout for monitored process [2024-10-11 13:45:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:09,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:45:09,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-10-11 13:45:09,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:45:09,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:09,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398322277] [2024-10-11 13:45:09,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398322277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:45:09,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:45:09,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:45:09,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378796636] [2024-10-11 13:45:09,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:09,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:45:09,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:09,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:45:09,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:45:09,692 INFO L87 Difference]: Start difference. First operand 276 states and 351 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:45:09,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:09,798 INFO L93 Difference]: Finished difference Result 436 states and 562 transitions. [2024-10-11 13:45:09,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:45:09,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 119 [2024-10-11 13:45:09,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:09,800 INFO L225 Difference]: With dead ends: 436 [2024-10-11 13:45:09,800 INFO L226 Difference]: Without dead ends: 293 [2024-10-11 13:45:09,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:45:09,801 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 38 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:09,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 282 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:45:09,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-11 13:45:09,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 276. [2024-10-11 13:45:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 247 states have (on average 1.263157894736842) internal successors, (312), 248 states have internal predecessors, (312), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:45:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 350 transitions. [2024-10-11 13:45:09,854 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 350 transitions. Word has length 119 [2024-10-11 13:45:09,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:09,855 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 350 transitions. [2024-10-11 13:45:09,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:45:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 350 transitions. [2024-10-11 13:45:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:45:09,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:09,856 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:45:09,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (28)] Ended with exit code 0 [2024-10-11 13:45:10,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:45:10,057 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:10,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:10,057 INFO L85 PathProgramCache]: Analyzing trace with hash 442687826, now seen corresponding path program 1 times [2024-10-11 13:45:10,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:10,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371707079] [2024-10-11 13:45:10,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:10,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:45:10,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:10,059 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:45:10,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (29)] Waiting until timeout for monitored process [2024-10-11 13:45:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:45:10,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 13:45:10,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:45:10,963 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 14 [2024-10-11 13:45:10,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-10-11 13:45:11,213 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 21 treesize of output 13 [2024-10-11 13:45:11,471 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 39 treesize of output 23 [2024-10-11 13:45:11,534 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 38 treesize of output 26 [2024-10-11 13:45:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 12 proven. 121 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-11 13:45:11,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:45:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-10-11 13:45:11,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:45:11,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371707079] [2024-10-11 13:45:11,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371707079] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:45:11,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:45:11,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-11 13:45:11,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321986179] [2024-10-11 13:45:11,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:45:11,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:45:11,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:45:11,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:45:11,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:45:11,641 INFO L87 Difference]: Start difference. First operand 276 states and 350 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:45:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:45:12,163 INFO L93 Difference]: Finished difference Result 596 states and 745 transitions. [2024-10-11 13:45:12,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:45:12,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 119 [2024-10-11 13:45:12,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:45:12,165 INFO L225 Difference]: With dead ends: 596 [2024-10-11 13:45:12,165 INFO L226 Difference]: Without dead ends: 453 [2024-10-11 13:45:12,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:45:12,166 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 56 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:45:12,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 279 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:45:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-10-11 13:45:12,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 284. [2024-10-11 13:45:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 255 states have (on average 1.2549019607843137) internal successors, (320), 256 states have internal predecessors, (320), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:45:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 358 transitions. [2024-10-11 13:45:12,242 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 358 transitions. Word has length 119 [2024-10-11 13:45:12,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:45:12,242 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 358 transitions. [2024-10-11 13:45:12,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 13:45:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 358 transitions. [2024-10-11 13:45:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 13:45:12,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:45:12,244 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:45:12,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (29)] Ended with exit code 0 [2024-10-11 13:45:12,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:45:12,446 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:45:12,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:45:12,446 INFO L85 PathProgramCache]: Analyzing trace with hash -909213904, now seen corresponding path program 1 times [2024-10-11 13:45:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:45:12,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311631791] [2024-10-11 13:45:12,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:45:12,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:45:12,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:45:12,450 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:45:12,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (30)] Waiting until timeout for monitored process