./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-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b8c217deaf7ee4e1e888f4bf55d7496164b7b59b8d275eb1ec0a6f1cdc42f43 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:42:15,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:42:15,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:42:16,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:42:16,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:42:16,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:42:16,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:42:16,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:42:16,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:42:16,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:42:16,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:42:16,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:42:16,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:42:16,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:42:16,033 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:42:16,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:42:16,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:42:16,034 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:42:16,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:42:16,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:42:16,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:42:16,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:42:16,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:42:16,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:42:16,039 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:42:16,039 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:42:16,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:42:16,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:42:16,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:42:16,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:42:16,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:42:16,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:42:16,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:42:16,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:42:16,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:42:16,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:42:16,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:42:16,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:42:16,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:42:16,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:42:16,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:42:16,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:42:16,044 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b8c217deaf7ee4e1e888f4bf55d7496164b7b59b8d275eb1ec0a6f1cdc42f43 [2024-10-24 11:42:16,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:42:16,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:42:16,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:42:16,325 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:42:16,326 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:42:16,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i [2024-10-24 11:42:17,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:42:17,942 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:42:17,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i [2024-10-24 11:42:17,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be90e4b8/22738b523cbb465495c7778bed5265a2/FLAGb10f71654 [2024-10-24 11:42:17,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be90e4b8/22738b523cbb465495c7778bed5265a2 [2024-10-24 11:42:17,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:42:17,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:42:17,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:42:17,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:42:17,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:42:17,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:42:17" (1/1) ... [2024-10-24 11:42:17,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a368945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:17, skipping insertion in model container [2024-10-24 11:42:17,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:42:17" (1/1) ... [2024-10-24 11:42:18,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:42:18,205 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-83.i[916,929] [2024-10-24 11:42:18,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:42:18,330 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:42:18,360 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-83.i[916,929] [2024-10-24 11:42:18,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:42:18,433 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:42:18,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:18 WrapperNode [2024-10-24 11:42:18,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:42:18,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:42:18,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:42:18,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:42:18,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:18" (1/1) ... [2024-10-24 11:42:18,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:18" (1/1) ... [2024-10-24 11:42:18,517 INFO L138 Inliner]: procedures = 29, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 544 [2024-10-24 11:42:18,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:42:18,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:42:18,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:42:18,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:42:18,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:18" (1/1) ... [2024-10-24 11:42:18,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:18" (1/1) ... [2024-10-24 11:42:18,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:18" (1/1) ... [2024-10-24 11:42:18,589 INFO L175 MemorySlicer]: Split 130 memory accesses to 13 slices as follows [2, 12, 6, 28, 9, 7, 20, 14, 3, 5, 15, 6, 3]. 22 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 3, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1]. [2024-10-24 11:42:18,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:18" (1/1) ... [2024-10-24 11:42:18,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:18" (1/1) ... [2024-10-24 11:42:18,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:18" (1/1) ... [2024-10-24 11:42:18,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:18" (1/1) ... [2024-10-24 11:42:18,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:18" (1/1) ... [2024-10-24 11:42:18,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:18" (1/1) ... [2024-10-24 11:42:18,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:42:18,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:42:18,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:42:18,646 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:42:18,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:18" (1/1) ... [2024-10-24 11:42:18,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:42:18,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:42:18,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:42:18,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:42:18,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:42:18,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:42:18,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:42:18,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:42:18,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:42:18,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:42:18,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:42:18,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-24 11:42:18,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-24 11:42:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-24 11:42:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-24 11:42:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-24 11:42:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-24 11:42:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-24 11:42:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:42:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:42:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:42:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:42:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:42:18,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:42:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 11:42:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 11:42:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-24 11:42:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-24 11:42:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-24 11:42:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-24 11:42:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-24 11:42:18,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:42:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:42:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:42:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:42:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:42:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:42:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-24 11:42:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-24 11:42:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-24 11:42:18,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-24 11:42:18,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-24 11:42:18,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-24 11:42:18,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-24 11:42:18,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:42:18,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:42:18,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:42:18,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:42:18,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:42:18,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:42:18,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 11:42:18,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 11:42:18,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-24 11:42:18,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-24 11:42:18,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-24 11:42:18,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-24 11:42:18,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-24 11:42:18,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:42:18,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:42:18,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:42:18,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:42:18,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:42:18,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:42:18,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-24 11:42:18,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-24 11:42:18,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-24 11:42:18,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-24 11:42:18,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-24 11:42:18,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-24 11:42:18,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-24 11:42:18,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:42:18,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:42:18,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:42:18,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:42:18,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:42:18,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:42:18,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:42:18,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:42:18,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 11:42:18,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 11:42:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-24 11:42:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-24 11:42:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-24 11:42:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-24 11:42:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-24 11:42:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:42:18,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:42:18,949 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:42:18,951 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:42:19,525 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-10-24 11:42:19,525 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:42:19,566 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:42:19,566 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:42:19,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:42:19 BoogieIcfgContainer [2024-10-24 11:42:19,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:42:19,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:42:19,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:42:19,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:42:19,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:42:17" (1/3) ... [2024-10-24 11:42:19,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bac8732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:42:19, skipping insertion in model container [2024-10-24 11:42:19,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:18" (2/3) ... [2024-10-24 11:42:19,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bac8732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:42:19, skipping insertion in model container [2024-10-24 11:42:19,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:42:19" (3/3) ... [2024-10-24 11:42:19,575 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-83.i [2024-10-24 11:42:19,591 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:42:19,592 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:42:19,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:42:19,661 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;@74ea6394, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:42:19,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:42:19,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 92 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:42:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:42:19,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:19,677 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:19,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:19,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:19,682 INFO L85 PathProgramCache]: Analyzing trace with hash -859057060, now seen corresponding path program 1 times [2024-10-24 11:42:19,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:19,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999425089] [2024-10-24 11:42:19,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:19,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:42:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:20,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:20,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999425089] [2024-10-24 11:42:20,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999425089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:20,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:20,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:42:20,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102342416] [2024-10-24 11:42:20,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:20,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:42:20,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:20,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:42:20,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:42:20,211 INFO L87 Difference]: Start difference. First operand has 105 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 92 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:42:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:20,252 INFO L93 Difference]: Finished difference Result 207 states and 327 transitions. [2024-10-24 11:42:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:42:20,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-24 11:42:20,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:20,265 INFO L225 Difference]: With dead ends: 207 [2024-10-24 11:42:20,266 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 11:42:20,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-24 11:42:20,273 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:20,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:42:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 11:42:20,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-24 11:42:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:42:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2024-10-24 11:42:20,327 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 101 [2024-10-24 11:42:20,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:20,328 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2024-10-24 11:42:20,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:42:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2024-10-24 11:42:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:42:20,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:20,334 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:20,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:42:20,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:20,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:20,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1754611118, now seen corresponding path program 1 times [2024-10-24 11:42:20,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:20,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539957563] [2024-10-24 11:42:20,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:20,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:42:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:20,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:20,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539957563] [2024-10-24 11:42:20,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539957563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:20,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:20,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:42:20,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072879222] [2024-10-24 11:42:20,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:20,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:42:20,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:20,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:42:20,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:42:20,657 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:42:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:20,707 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions. [2024-10-24 11:42:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:42:20,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-24 11:42:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:20,710 INFO L225 Difference]: With dead ends: 207 [2024-10-24 11:42:20,710 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 11:42:20,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-24 11:42:20,712 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:20,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 419 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:42:20,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 11:42:20,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-24 11:42:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:42:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2024-10-24 11:42:20,724 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 101 [2024-10-24 11:42:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:20,725 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2024-10-24 11:42:20,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:42:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2024-10-24 11:42:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:42:20,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:20,729 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:20,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:42:20,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:20,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:20,730 INFO L85 PathProgramCache]: Analyzing trace with hash -184550928, now seen corresponding path program 1 times [2024-10-24 11:42:20,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:20,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348858517] [2024-10-24 11:42:20,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:42:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:20,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:20,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348858517] [2024-10-24 11:42:20,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348858517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:20,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:20,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:42:20,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791236386] [2024-10-24 11:42:20,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:20,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:42:20,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:20,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:42:20,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:42:20,980 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:21,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:21,035 INFO L93 Difference]: Finished difference Result 212 states and 303 transitions. [2024-10-24 11:42:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:42:21,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-24 11:42:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:21,038 INFO L225 Difference]: With dead ends: 212 [2024-10-24 11:42:21,038 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 11:42:21,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-24 11:42:21,040 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 416 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-24 11:42:21,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 416 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:42:21,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 11:42:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-24 11:42:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:42:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-10-24 11:42:21,048 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 101 [2024-10-24 11:42:21,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:21,049 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-10-24 11:42:21,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:21,049 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-10-24 11:42:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:42:21,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:21,051 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:21,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:42:21,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:21,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:21,052 INFO L85 PathProgramCache]: Analyzing trace with hash -993897554, now seen corresponding path program 1 times [2024-10-24 11:42:21,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:21,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713754873] [2024-10-24 11:42:21,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:21,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:42:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:21,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:21,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713754873] [2024-10-24 11:42:21,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713754873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:21,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:21,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:42:21,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289034740] [2024-10-24 11:42:21,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:21,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:42:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:21,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:42:21,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:42:21,287 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:21,337 INFO L93 Difference]: Finished difference Result 216 states and 307 transitions. [2024-10-24 11:42:21,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:42:21,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-24 11:42:21,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:21,343 INFO L225 Difference]: With dead ends: 216 [2024-10-24 11:42:21,343 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 11:42:21,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-24 11:42:21,345 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 417 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-24 11:42:21,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 417 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:42:21,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 11:42:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-10-24 11:42:21,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:42:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-10-24 11:42:21,365 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 101 [2024-10-24 11:42:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:21,367 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-10-24 11:42:21,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-10-24 11:42:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:42:21,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:21,369 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:21,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:42:21,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:21,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:21,370 INFO L85 PathProgramCache]: Analyzing trace with hash -936639252, now seen corresponding path program 1 times [2024-10-24 11:42:21,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:21,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636505810] [2024-10-24 11:42:21,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:21,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:42:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:21,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:21,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636505810] [2024-10-24 11:42:21,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636505810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:21,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:21,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:42:21,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775590883] [2024-10-24 11:42:21,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:21,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:42:21,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:21,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:42:21,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:42:21,559 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:21,599 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2024-10-24 11:42:21,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:42:21,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-24 11:42:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:21,603 INFO L225 Difference]: With dead ends: 220 [2024-10-24 11:42:21,603 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 11:42:21,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-24 11:42:21,606 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:21,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 420 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:42:21,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 11:42:21,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-24 11:42:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:42:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2024-10-24 11:42:21,616 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 101 [2024-10-24 11:42:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:21,617 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2024-10-24 11:42:21,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2024-10-24 11:42:21,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:42:21,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:21,618 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:21,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:42:21,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:21,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:21,619 INFO L85 PathProgramCache]: Analyzing trace with hash -936579670, now seen corresponding path program 1 times [2024-10-24 11:42:21,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:21,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990346466] [2024-10-24 11:42:21,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:21,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:42:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:21,896 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:21,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:21,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990346466] [2024-10-24 11:42:21,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990346466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:21,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:21,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:42:21,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970474854] [2024-10-24 11:42:21,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:21,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:42:21,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:21,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:42:21,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:42:21,899 INFO L87 Difference]: Start difference. First operand 111 states and 156 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:21,983 INFO L93 Difference]: Finished difference Result 260 states and 366 transitions. [2024-10-24 11:42:21,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:42:21,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-24 11:42:21,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:21,985 INFO L225 Difference]: With dead ends: 260 [2024-10-24 11:42:21,985 INFO L226 Difference]: Without dead ends: 150 [2024-10-24 11:42:21,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:42:21,986 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 145 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:21,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 420 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:42:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-24 11:42:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 111. [2024-10-24 11:42:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:42:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2024-10-24 11:42:22,006 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 155 transitions. Word has length 101 [2024-10-24 11:42:22,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:22,007 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 155 transitions. [2024-10-24 11:42:22,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:22,007 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2024-10-24 11:42:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 11:42:22,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:22,008 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:22,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:42:22,008 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:22,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:22,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2061795194, now seen corresponding path program 1 times [2024-10-24 11:42:22,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:22,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673459227] [2024-10-24 11:42:22,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:22,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:42:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,263 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:22,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:22,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673459227] [2024-10-24 11:42:22,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673459227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:22,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:22,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:42:22,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698689478] [2024-10-24 11:42:22,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:22,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:42:22,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:22,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:42:22,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:42:22,267 INFO L87 Difference]: Start difference. First operand 111 states and 155 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:22,346 INFO L93 Difference]: Finished difference Result 223 states and 312 transitions. [2024-10-24 11:42:22,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:42:22,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2024-10-24 11:42:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:22,349 INFO L225 Difference]: With dead ends: 223 [2024-10-24 11:42:22,349 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 11:42:22,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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-24 11:42:22,350 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 3 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:22,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 516 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:42:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 11:42:22,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-24 11:42:22,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:42:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2024-10-24 11:42:22,364 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 102 [2024-10-24 11:42:22,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:22,364 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2024-10-24 11:42:22,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2024-10-24 11:42:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:42:22,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:22,367 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:22,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:42:22,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:22,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:22,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2060604880, now seen corresponding path program 1 times [2024-10-24 11:42:22,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:22,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561009964] [2024-10-24 11:42:22,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:22,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:42:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:22,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:23,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:23,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561009964] [2024-10-24 11:42:23,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561009964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:23,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:23,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:42:23,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732594919] [2024-10-24 11:42:23,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:23,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:42:23,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:23,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:42:23,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:42:23,007 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:23,194 INFO L93 Difference]: Finished difference Result 304 states and 420 transitions. [2024-10-24 11:42:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:42:23,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-24 11:42:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:23,197 INFO L225 Difference]: With dead ends: 304 [2024-10-24 11:42:23,197 INFO L226 Difference]: Without dead ends: 192 [2024-10-24 11:42:23,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:42:23,199 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 86 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:23,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 832 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:42:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-24 11:42:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2024-10-24 11:42:23,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 172 states have internal predecessors, (231), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:42:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 261 transitions. [2024-10-24 11:42:23,221 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 261 transitions. Word has length 103 [2024-10-24 11:42:23,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:23,222 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 261 transitions. [2024-10-24 11:42:23,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:23,222 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 261 transitions. [2024-10-24 11:42:23,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:42:23,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:23,225 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:23,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:42:23,225 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:23,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:23,226 INFO L85 PathProgramCache]: Analyzing trace with hash 780741202, now seen corresponding path program 1 times [2024-10-24 11:42:23,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:23,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647132368] [2024-10-24 11:42:23,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:23,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:42:23,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956732517] [2024-10-24 11:42:23,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:23,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:42:23,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:42:23,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:42:23,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:42:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:23,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-24 11:42:23,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:42:24,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:24,389 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 23 treesize of output 3 [2024-10-24 11:42:24,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:24,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 15 treesize of output 11 [2024-10-24 11:42:24,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:24,869 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 7 treesize of output 3 [2024-10-24 11:42:24,874 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-24 11:42:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 194 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 11:42:24,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:42:25,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-10-24 11:42:26,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:26,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647132368] [2024-10-24 11:42:26,187 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:42:26,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956732517] [2024-10-24 11:42:26,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956732517] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:42:26,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:42:26,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-10-24 11:42:26,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250538260] [2024-10-24 11:42:26,188 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 11:42:26,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:42:26,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:26,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:42:26,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=551, Unknown=6, NotChecked=0, Total=702 [2024-10-24 11:42:26,190 INFO L87 Difference]: Start difference. First operand 189 states and 261 transitions. Second operand has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-24 11:42:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:27,273 INFO L93 Difference]: Finished difference Result 539 states and 734 transitions. [2024-10-24 11:42:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 11:42:27,273 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 103 [2024-10-24 11:42:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:27,277 INFO L225 Difference]: With dead ends: 539 [2024-10-24 11:42:27,277 INFO L226 Difference]: Without dead ends: 351 [2024-10-24 11:42:27,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=491, Invalid=1573, Unknown=6, NotChecked=0, Total=2070 [2024-10-24 11:42:27,279 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 560 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:27,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1215 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:42:27,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-24 11:42:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 215. [2024-10-24 11:42:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 196 states have (on average 1.3673469387755102) internal successors, (268), 197 states have internal predecessors, (268), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:42:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 298 transitions. [2024-10-24 11:42:27,297 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 298 transitions. Word has length 103 [2024-10-24 11:42:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:27,298 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 298 transitions. [2024-10-24 11:42:27,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 6 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-24 11:42:27,298 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 298 transitions. [2024-10-24 11:42:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:42:27,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:27,300 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:27,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:42:27,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:42:27,501 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:27,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:27,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1171126897, now seen corresponding path program 1 times [2024-10-24 11:42:27,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:27,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484731607] [2024-10-24 11:42:27,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:27,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:42:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:28,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:28,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484731607] [2024-10-24 11:42:28,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484731607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:28,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:28,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:42:28,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952458679] [2024-10-24 11:42:28,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:28,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:42:28,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:28,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:42:28,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:42:28,099 INFO L87 Difference]: Start difference. First operand 215 states and 298 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 11:42:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:28,436 INFO L93 Difference]: Finished difference Result 476 states and 656 transitions. [2024-10-24 11:42:28,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:42:28,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103 [2024-10-24 11:42:28,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:28,439 INFO L225 Difference]: With dead ends: 476 [2024-10-24 11:42:28,439 INFO L226 Difference]: Without dead ends: 262 [2024-10-24 11:42:28,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:42:28,440 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 471 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:28,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 494 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:42:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-24 11:42:28,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2024-10-24 11:42:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 228 states have (on average 1.3333333333333333) internal successors, (304), 230 states have internal predecessors, (304), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 11:42:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 356 transitions. [2024-10-24 11:42:28,457 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 356 transitions. Word has length 103 [2024-10-24 11:42:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:28,457 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 356 transitions. [2024-10-24 11:42:28,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 11:42:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 356 transitions. [2024-10-24 11:42:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:42:28,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:28,459 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:28,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:42:28,459 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:28,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:28,460 INFO L85 PathProgramCache]: Analyzing trace with hash -311134382, now seen corresponding path program 1 times [2024-10-24 11:42:28,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:28,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394926685] [2024-10-24 11:42:28,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:28,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:42:28,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1017132969] [2024-10-24 11:42:28,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:28,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:42:28,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:42:28,557 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:42:28,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:42:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:28,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-24 11:42:28,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:42:29,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:29,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:29,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:30,012 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 15 treesize of output 11 [2024-10-24 11:42:30,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:30,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-24 11:42:30,283 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 23 treesize of output 15 [2024-10-24 11:42:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:42:30,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:42:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:30,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:30,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394926685] [2024-10-24 11:42:30,758 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:42:30,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017132969] [2024-10-24 11:42:30,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017132969] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:42:30,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:42:30,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2024-10-24 11:42:30,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563939634] [2024-10-24 11:42:30,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:30,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:42:30,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:30,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:42:30,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:42:30,761 INFO L87 Difference]: Start difference. First operand 261 states and 356 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:31,502 INFO L93 Difference]: Finished difference Result 615 states and 835 transitions. [2024-10-24 11:42:31,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:42:31,505 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-24 11:42:31,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:31,508 INFO L225 Difference]: With dead ends: 615 [2024-10-24 11:42:31,508 INFO L226 Difference]: Without dead ends: 400 [2024-10-24 11:42:31,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2024-10-24 11:42:31,511 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 460 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:31,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 838 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:42:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-24 11:42:31,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 394. [2024-10-24 11:42:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 354 states have (on average 1.3389830508474576) internal successors, (474), 358 states have internal predecessors, (474), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 11:42:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 534 transitions. [2024-10-24 11:42:31,536 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 534 transitions. Word has length 103 [2024-10-24 11:42:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:31,536 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 534 transitions. [2024-10-24 11:42:31,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 534 transitions. [2024-10-24 11:42:31,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:42:31,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:31,538 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:31,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:42:31,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-24 11:42:31,743 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:31,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:31,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1332202736, now seen corresponding path program 1 times [2024-10-24 11:42:31,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:31,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66321493] [2024-10-24 11:42:31,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:31,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:42:31,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507330447] [2024-10-24 11:42:31,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:31,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:42:31,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:42:31,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:42:31,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 11:42:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:32,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 11:42:32,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:42:32,256 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-24 11:42:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:32,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:42:32,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:32,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66321493] [2024-10-24 11:42:32,267 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:42:32,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507330447] [2024-10-24 11:42:32,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507330447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:32,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:32,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:42:32,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489458012] [2024-10-24 11:42:32,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:32,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:42:32,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:32,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:42:32,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:42:32,269 INFO L87 Difference]: Start difference. First operand 394 states and 534 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:32,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:32,592 INFO L93 Difference]: Finished difference Result 1197 states and 1636 transitions. [2024-10-24 11:42:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:42:32,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-24 11:42:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:32,596 INFO L225 Difference]: With dead ends: 1197 [2024-10-24 11:42:32,596 INFO L226 Difference]: Without dead ends: 854 [2024-10-24 11:42:32,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:42:32,597 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 284 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:32,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1136 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:42:32,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-10-24 11:42:32,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 577. [2024-10-24 11:42:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 518 states have (on average 1.337837837837838) internal successors, (693), 523 states have internal predecessors, (693), 45 states have call successors, (45), 13 states have call predecessors, (45), 13 states have return successors, (45), 40 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 11:42:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 783 transitions. [2024-10-24 11:42:32,631 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 783 transitions. Word has length 103 [2024-10-24 11:42:32,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:32,632 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 783 transitions. [2024-10-24 11:42:32,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 783 transitions. [2024-10-24 11:42:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:42:32,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:32,634 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:32,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:42:32,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:42:32,835 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:32,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:32,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1841675826, now seen corresponding path program 1 times [2024-10-24 11:42:32,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:32,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396997088] [2024-10-24 11:42:32,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:32,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:42:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-24 11:42:33,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:33,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396997088] [2024-10-24 11:42:33,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396997088] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:42:33,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693002104] [2024-10-24 11:42:33,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:33,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:42:33,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:42:33,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:42:33,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 11:42:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:34,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 11:42:34,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:42:34,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:34,794 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 13 [2024-10-24 11:42:34,801 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 22 treesize of output 14 [2024-10-24 11:42:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 4 proven. 132 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:42:34,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:42:35,059 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 22 treesize of output 18 [2024-10-24 11:42:35,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693002104] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:42:35,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:42:35,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2024-10-24 11:42:35,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751143317] [2024-10-24 11:42:35,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:42:35,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 11:42:35,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:35,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 11:42:35,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=533, Unknown=1, NotChecked=0, Total=600 [2024-10-24 11:42:35,137 INFO L87 Difference]: Start difference. First operand 577 states and 783 transitions. Second operand has 22 states, 20 states have (on average 4.85) internal successors, (97), 21 states have internal predecessors, (97), 7 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) [2024-10-24 11:42:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:37,841 INFO L93 Difference]: Finished difference Result 1243 states and 1678 transitions. [2024-10-24 11:42:37,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 11:42:37,842 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 4.85) internal successors, (97), 21 states have internal predecessors, (97), 7 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) Word has length 103 [2024-10-24 11:42:37,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:37,846 INFO L225 Difference]: With dead ends: 1243 [2024-10-24 11:42:37,846 INFO L226 Difference]: Without dead ends: 898 [2024-10-24 11:42:37,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=505, Invalid=2916, Unknown=1, NotChecked=0, Total=3422 [2024-10-24 11:42:37,851 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 1161 mSDsluCounter, 2533 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 153 mSolverCounterUnsat, 42 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 42 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:37,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 2717 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1165 Invalid, 42 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 11:42:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-10-24 11:42:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 460. [2024-10-24 11:42:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 412 states have (on average 1.3470873786407767) internal successors, (555), 414 states have internal predecessors, (555), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 11:42:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 625 transitions. [2024-10-24 11:42:37,886 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 625 transitions. Word has length 103 [2024-10-24 11:42:37,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:37,886 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 625 transitions. [2024-10-24 11:42:37,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 4.85) internal successors, (97), 21 states have internal predecessors, (97), 7 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) [2024-10-24 11:42:37,886 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 625 transitions. [2024-10-24 11:42:37,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:42:37,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:37,888 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:37,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 11:42:38,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:42:38,089 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:38,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:38,089 INFO L85 PathProgramCache]: Analyzing trace with hash -209392033, now seen corresponding path program 1 times [2024-10-24 11:42:38,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:38,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252457442] [2024-10-24 11:42:38,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:38,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:42:38,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561566912] [2024-10-24 11:42:38,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:38,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:42:38,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:42:38,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:42:38,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 11:42:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:38,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:42:38,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:42:38,679 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 13 [2024-10-24 11:42:38,686 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 9 treesize of output 5 [2024-10-24 11:42:38,713 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 15 treesize of output 7 [2024-10-24 11:42:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:38,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:42:38,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:38,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252457442] [2024-10-24 11:42:38,725 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:42:38,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561566912] [2024-10-24 11:42:38,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561566912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:38,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:38,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:42:38,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190630011] [2024-10-24 11:42:38,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:38,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:42:38,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:38,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:42:38,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:42:38,728 INFO L87 Difference]: Start difference. First operand 460 states and 625 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:38,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:38,831 INFO L93 Difference]: Finished difference Result 1107 states and 1507 transitions. [2024-10-24 11:42:38,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:42:38,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-10-24 11:42:38,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:38,836 INFO L225 Difference]: With dead ends: 1107 [2024-10-24 11:42:38,837 INFO L226 Difference]: Without dead ends: 744 [2024-10-24 11:42:38,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:42:38,839 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 113 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:38,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 633 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:42:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2024-10-24 11:42:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 502. [2024-10-24 11:42:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 454 states have (on average 1.354625550660793) internal successors, (615), 456 states have internal predecessors, (615), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 11:42:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 685 transitions. [2024-10-24 11:42:38,897 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 685 transitions. Word has length 104 [2024-10-24 11:42:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:38,897 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 685 transitions. [2024-10-24 11:42:38,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 685 transitions. [2024-10-24 11:42:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:42:38,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:38,899 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:38,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 11:42:39,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-24 11:42:39,100 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:39,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:39,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1230460387, now seen corresponding path program 1 times [2024-10-24 11:42:39,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:39,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085677509] [2024-10-24 11:42:39,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:39,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:42:39,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1003232315] [2024-10-24 11:42:39,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:39,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:42:39,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:42:39,181 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:42:39,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 11:42:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:39,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-24 11:42:39,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:42:39,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:39,916 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 23 treesize of output 3 [2024-10-24 11:42:40,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:40,059 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 15 treesize of output 11 [2024-10-24 11:42:40,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:40,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 24 treesize of output 16 [2024-10-24 11:42:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-24 11:42:40,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:42:40,260 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:40,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:40,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085677509] [2024-10-24 11:42:40,261 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:42:40,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003232315] [2024-10-24 11:42:40,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003232315] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:42:40,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:42:40,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-10-24 11:42:40,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516630663] [2024-10-24 11:42:40,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:40,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:42:40,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:40,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:42:40,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:42:40,263 INFO L87 Difference]: Start difference. First operand 502 states and 685 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:40,420 INFO L93 Difference]: Finished difference Result 979 states and 1341 transitions. [2024-10-24 11:42:40,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:42:40,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-10-24 11:42:40,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:40,424 INFO L225 Difference]: With dead ends: 979 [2024-10-24 11:42:40,424 INFO L226 Difference]: Without dead ends: 583 [2024-10-24 11:42:40,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:42:40,428 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 68 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:40,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 714 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:42:40,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-10-24 11:42:40,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 504. [2024-10-24 11:42:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 456 states have (on average 1.3464912280701755) internal successors, (614), 458 states have internal predecessors, (614), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 11:42:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 684 transitions. [2024-10-24 11:42:40,468 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 684 transitions. Word has length 104 [2024-10-24 11:42:40,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:40,468 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 684 transitions. [2024-10-24 11:42:40,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 684 transitions. [2024-10-24 11:42:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 11:42:40,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:40,470 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:40,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 11:42:40,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-24 11:42:40,671 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:40,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash 155743007, now seen corresponding path program 1 times [2024-10-24 11:42:40,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:40,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019197835] [2024-10-24 11:42:40,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:40,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:42:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:42,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:42,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019197835] [2024-10-24 11:42:42,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019197835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:42,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:42,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-24 11:42:42,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306421063] [2024-10-24 11:42:42,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:42,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 11:42:42,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:42,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 11:42:42,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:42:42,077 INFO L87 Difference]: Start difference. First operand 504 states and 684 transitions. Second operand has 18 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-24 11:42:44,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:44,091 INFO L93 Difference]: Finished difference Result 914 states and 1245 transitions. [2024-10-24 11:42:44,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 11:42:44,091 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 104 [2024-10-24 11:42:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:44,095 INFO L225 Difference]: With dead ends: 914 [2024-10-24 11:42:44,095 INFO L226 Difference]: Without dead ends: 602 [2024-10-24 11:42:44,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2024-10-24 11:42:44,097 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 511 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:44,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1744 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 11:42:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-10-24 11:42:44,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 504. [2024-10-24 11:42:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 456 states have (on average 1.3464912280701755) internal successors, (614), 458 states have internal predecessors, (614), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 11:42:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 684 transitions. [2024-10-24 11:42:44,129 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 684 transitions. Word has length 104 [2024-10-24 11:42:44,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:44,130 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 684 transitions. [2024-10-24 11:42:44,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 6 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-24 11:42:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 684 transitions. [2024-10-24 11:42:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:42:44,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:44,131 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:44,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:42:44,132 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:44,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:44,132 INFO L85 PathProgramCache]: Analyzing trace with hash 114482255, now seen corresponding path program 1 times [2024-10-24 11:42:44,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:44,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444619751] [2024-10-24 11:42:44,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:44,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:42:44,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420216049] [2024-10-24 11:42:44,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:44,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:42:44,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:42:44,219 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:42:44,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 11:42:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:44,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-24 11:42:44,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:42:45,025 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 23 treesize of output 3 [2024-10-24 11:42:45,123 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 23 treesize of output 3 [2024-10-24 11:42:45,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:45,216 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 15 treesize of output 11 [2024-10-24 11:42:45,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:45,322 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 33 treesize of output 25 [2024-10-24 11:42:45,325 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-24 11:42:45,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-24 11:42:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-24 11:42:46,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:42:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:46,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:46,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444619751] [2024-10-24 11:42:46,606 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:42:46,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420216049] [2024-10-24 11:42:46,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420216049] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:42:46,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:42:46,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 13 [2024-10-24 11:42:46,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747916264] [2024-10-24 11:42:46,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:46,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:42:46,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:46,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:42:46,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:42:46,608 INFO L87 Difference]: Start difference. First operand 504 states and 684 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:47,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:47,345 INFO L93 Difference]: Finished difference Result 1001 states and 1362 transitions. [2024-10-24 11:42:47,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:42:47,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-24 11:42:47,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:47,349 INFO L225 Difference]: With dead ends: 1001 [2024-10-24 11:42:47,349 INFO L226 Difference]: Without dead ends: 605 [2024-10-24 11:42:47,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:42:47,350 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 97 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:47,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 994 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:42:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-10-24 11:42:47,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 494. [2024-10-24 11:42:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 446 states have (on average 1.3408071748878925) internal successors, (598), 448 states have internal predecessors, (598), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 11:42:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 668 transitions. [2024-10-24 11:42:47,384 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 668 transitions. Word has length 105 [2024-10-24 11:42:47,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:47,384 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 668 transitions. [2024-10-24 11:42:47,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:47,385 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 668 transitions. [2024-10-24 11:42:47,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:42:47,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:47,386 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:47,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-24 11:42:47,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:42:47,591 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:47,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:47,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1514417969, now seen corresponding path program 1 times [2024-10-24 11:42:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:47,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812248765] [2024-10-24 11:42:47,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:47,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:42:47,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652020635] [2024-10-24 11:42:47,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:47,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:42:47,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:42:47,673 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:42:47,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 11:42:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:48,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-24 11:42:48,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:42:48,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:48,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:48,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:48,529 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 15 treesize of output 11 [2024-10-24 11:42:48,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:48,694 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 33 treesize of output 25 [2024-10-24 11:42:48,698 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-24 11:42:48,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-24 11:42:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 11:42:48,747 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:42:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:48,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:48,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812248765] [2024-10-24 11:42:48,982 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:42:48,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652020635] [2024-10-24 11:42:48,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652020635] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:42:48,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:42:48,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2024-10-24 11:42:48,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206128467] [2024-10-24 11:42:48,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:48,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:42:48,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:48,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:42:48,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:42:48,983 INFO L87 Difference]: Start difference. First operand 494 states and 668 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:49,400 INFO L93 Difference]: Finished difference Result 983 states and 1335 transitions. [2024-10-24 11:42:49,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:42:49,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-24 11:42:49,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:49,404 INFO L225 Difference]: With dead ends: 983 [2024-10-24 11:42:49,404 INFO L226 Difference]: Without dead ends: 597 [2024-10-24 11:42:49,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:42:49,406 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 97 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:49,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 838 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:42:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-10-24 11:42:49,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 494. [2024-10-24 11:42:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 446 states have (on average 1.3385650224215246) internal successors, (597), 448 states have internal predecessors, (597), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 11:42:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 667 transitions. [2024-10-24 11:42:49,443 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 667 transitions. Word has length 105 [2024-10-24 11:42:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:49,443 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 667 transitions. [2024-10-24 11:42:49,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 667 transitions. [2024-10-24 11:42:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:42:49,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:49,445 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:49,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-24 11:42:49,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-24 11:42:49,646 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:49,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:49,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1500685649, now seen corresponding path program 1 times [2024-10-24 11:42:49,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:49,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785293413] [2024-10-24 11:42:49,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:49,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:42:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:50,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:50,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785293413] [2024-10-24 11:42:50,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785293413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:50,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:50,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:42:50,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125436142] [2024-10-24 11:42:50,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:50,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:42:50,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:50,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:42:50,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:42:50,115 INFO L87 Difference]: Start difference. First operand 494 states and 667 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 11:42:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:50,433 INFO L93 Difference]: Finished difference Result 985 states and 1330 transitions. [2024-10-24 11:42:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:42:50,434 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 105 [2024-10-24 11:42:50,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:50,437 INFO L225 Difference]: With dead ends: 985 [2024-10-24 11:42:50,437 INFO L226 Difference]: Without dead ends: 612 [2024-10-24 11:42:50,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:42:50,449 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 214 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:50,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1157 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:42:50,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-10-24 11:42:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 493. [2024-10-24 11:42:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 445 states have (on average 1.3393258426966292) internal successors, (596), 447 states have internal predecessors, (596), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 11:42:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 666 transitions. [2024-10-24 11:42:50,489 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 666 transitions. Word has length 105 [2024-10-24 11:42:50,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:50,490 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 666 transitions. [2024-10-24 11:42:50,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 11:42:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 666 transitions. [2024-10-24 11:42:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:42:50,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:50,492 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:50,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 11:42:50,492 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:50,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash 863063924, now seen corresponding path program 1 times [2024-10-24 11:42:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280823887] [2024-10-24 11:42:50,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:50,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:42:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:50,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:50,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280823887] [2024-10-24 11:42:50,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280823887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:50,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:50,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:42:50,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107146169] [2024-10-24 11:42:50,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:50,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:42:50,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:50,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:42:50,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:42:50,640 INFO L87 Difference]: Start difference. First operand 493 states and 666 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:50,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:50,781 INFO L93 Difference]: Finished difference Result 909 states and 1231 transitions. [2024-10-24 11:42:50,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:42:50,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-24 11:42:50,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:50,785 INFO L225 Difference]: With dead ends: 909 [2024-10-24 11:42:50,785 INFO L226 Difference]: Without dead ends: 607 [2024-10-24 11:42:50,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-24 11:42:50,786 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 112 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:50,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 644 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:42:50,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-10-24 11:42:50,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 524. [2024-10-24 11:42:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 476 states have (on average 1.3361344537815125) internal successors, (636), 478 states have internal predecessors, (636), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 11:42:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 706 transitions. [2024-10-24 11:42:50,824 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 706 transitions. Word has length 105 [2024-10-24 11:42:50,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:50,824 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 706 transitions. [2024-10-24 11:42:50,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 706 transitions. [2024-10-24 11:42:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:42:50,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:50,826 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:50,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 11:42:50,827 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:50,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:50,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1666652576, now seen corresponding path program 1 times [2024-10-24 11:42:50,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:50,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110190929] [2024-10-24 11:42:50,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:50,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:42:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:50,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:50,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110190929] [2024-10-24 11:42:50,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110190929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:50,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:50,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:42:50,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127094385] [2024-10-24 11:42:50,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:50,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:42:50,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:50,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:42:50,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:42:50,920 INFO L87 Difference]: Start difference. First operand 524 states and 706 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:50,958 INFO L93 Difference]: Finished difference Result 935 states and 1268 transitions. [2024-10-24 11:42:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:42:50,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-24 11:42:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:50,961 INFO L225 Difference]: With dead ends: 935 [2024-10-24 11:42:50,962 INFO L226 Difference]: Without dead ends: 516 [2024-10-24 11:42:50,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-24 11:42:50,963 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:50,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:42:50,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-24 11:42:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2024-10-24 11:42:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 468 states have (on average 1.3333333333333333) internal successors, (624), 470 states have internal predecessors, (624), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 11:42:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 694 transitions. [2024-10-24 11:42:51,018 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 694 transitions. Word has length 105 [2024-10-24 11:42:51,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:51,018 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 694 transitions. [2024-10-24 11:42:51,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 694 transitions. [2024-10-24 11:42:51,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:42:51,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:51,020 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:51,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 11:42:51,020 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:51,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:51,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1988543095, now seen corresponding path program 1 times [2024-10-24 11:42:51,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:51,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673163855] [2024-10-24 11:42:51,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:51,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:51,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:42:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:51,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:42:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:51,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:42:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:51,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:42:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:51,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:42:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:51,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:42:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:51,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:42:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:42:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:51,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:42:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:51,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:42:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:51,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:42:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:51,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:51,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673163855] [2024-10-24 11:42:51,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673163855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:42:51,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:42:51,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:42:51,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029723432] [2024-10-24 11:42:51,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:51,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:42:51,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:51,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:42:51,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:42:51,203 INFO L87 Difference]: Start difference. First operand 516 states and 694 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:51,266 INFO L93 Difference]: Finished difference Result 953 states and 1289 transitions. [2024-10-24 11:42:51,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:42:51,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-24 11:42:51,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:51,269 INFO L225 Difference]: With dead ends: 953 [2024-10-24 11:42:51,269 INFO L226 Difference]: Without dead ends: 515 [2024-10-24 11:42:51,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-24 11:42:51,272 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 63 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:51,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 534 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:42:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-24 11:42:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 481. [2024-10-24 11:42:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 433 states have (on average 1.302540415704388) internal successors, (564), 435 states have internal predecessors, (564), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 11:42:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 634 transitions. [2024-10-24 11:42:51,304 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 634 transitions. Word has length 105 [2024-10-24 11:42:51,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:51,304 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 634 transitions. [2024-10-24 11:42:51,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:51,304 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 634 transitions. [2024-10-24 11:42:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:42:51,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:51,305 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:51,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 11:42:51,306 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:51,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:51,306 INFO L85 PathProgramCache]: Analyzing trace with hash 137114509, now seen corresponding path program 1 times [2024-10-24 11:42:51,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:51,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410958149] [2024-10-24 11:42:51,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:51,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:42:51,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [488463924] [2024-10-24 11:42:51,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:51,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:42:51,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:42:51,359 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:42:51,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-24 11:42:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:42:51,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 11:42:51,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:42:51,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:51,893 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 15 treesize of output 11 [2024-10-24 11:42:51,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:42:51,966 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-24 11:42:51,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:42:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:42:52,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:42:52,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410958149] [2024-10-24 11:42:52,084 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:42:52,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488463924] [2024-10-24 11:42:52,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488463924] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:42:52,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:42:52,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-10-24 11:42:52,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825068137] [2024-10-24 11:42:52,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:42:52,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:42:52,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:42:52,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:42:52,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:42:52,085 INFO L87 Difference]: Start difference. First operand 481 states and 634 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:52,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:42:52,319 INFO L93 Difference]: Finished difference Result 936 states and 1238 transitions. [2024-10-24 11:42:52,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:42:52,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-24 11:42:52,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:42:52,322 INFO L225 Difference]: With dead ends: 936 [2024-10-24 11:42:52,322 INFO L226 Difference]: Without dead ends: 551 [2024-10-24 11:42:52,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:42:52,324 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 84 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:42:52,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 491 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:42:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-10-24 11:42:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 462. [2024-10-24 11:42:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 414 states have (on average 1.2922705314009661) internal successors, (535), 416 states have internal predecessors, (535), 35 states have call successors, (35), 12 states have call predecessors, (35), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 11:42:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 605 transitions. [2024-10-24 11:42:52,360 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 605 transitions. Word has length 105 [2024-10-24 11:42:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:42:52,360 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 605 transitions. [2024-10-24 11:42:52,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:42:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 605 transitions. [2024-10-24 11:42:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 11:42:52,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:42:52,362 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:42:52,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-24 11:42:52,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:42:52,567 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:42:52,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:42:52,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1512587715, now seen corresponding path program 1 times [2024-10-24 11:42:52,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:42:52,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711394777] [2024-10-24 11:42:52,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:52,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:42:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:42:52,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607932896] [2024-10-24 11:42:52,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:42:52,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:42:52,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:42:52,632 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:42:52,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-24 11:42:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:42:53,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:42:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:42:53,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:42:53,327 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:42:53,328 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:42:53,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-24 11:42:53,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-24 11:42:53,536 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:42:53,689 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:42:53,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:42:53 BoogieIcfgContainer [2024-10-24 11:42:53,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:42:53,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:42:53,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:42:53,693 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:42:53,693 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:42:19" (3/4) ... [2024-10-24 11:42:53,695 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:42:53,696 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:42:53,700 INFO L158 Benchmark]: Toolchain (without parser) took 35718.69ms. Allocated memory was 123.7MB in the beginning and 375.4MB in the end (delta: 251.7MB). Free memory was 55.0MB in the beginning and 162.8MB in the end (delta: -107.7MB). Peak memory consumption was 145.2MB. Max. memory is 16.1GB. [2024-10-24 11:42:53,700 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:42:53,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.04ms. Allocated memory was 123.7MB in the beginning and 165.7MB in the end (delta: 41.9MB). Free memory was 55.0MB in the beginning and 133.8MB in the end (delta: -78.7MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-10-24 11:42:53,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.68ms. Allocated memory is still 165.7MB. Free memory was 133.8MB in the beginning and 129.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:42:53,701 INFO L158 Benchmark]: Boogie Preprocessor took 125.86ms. Allocated memory is still 165.7MB. Free memory was 129.6MB in the beginning and 123.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:42:53,701 INFO L158 Benchmark]: RCFGBuilder took 921.71ms. Allocated memory is still 165.7MB. Free memory was 123.3MB in the beginning and 73.0MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-10-24 11:42:53,701 INFO L158 Benchmark]: TraceAbstraction took 34123.33ms. Allocated memory was 165.7MB in the beginning and 375.4MB in the end (delta: 209.7MB). Free memory was 71.9MB in the beginning and 162.8MB in the end (delta: -90.9MB). Peak memory consumption was 118.8MB. Max. memory is 16.1GB. [2024-10-24 11:42:53,701 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 375.4MB. Free memory is still 162.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:42:53,702 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 123.7MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.04ms. Allocated memory was 123.7MB in the beginning and 165.7MB in the end (delta: 41.9MB). Free memory was 55.0MB in the beginning and 133.8MB in the end (delta: -78.7MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.68ms. Allocated memory is still 165.7MB. Free memory was 133.8MB in the beginning and 129.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.86ms. Allocated memory is still 165.7MB. Free memory was 129.6MB in the beginning and 123.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 921.71ms. Allocated memory is still 165.7MB. Free memory was 123.3MB in the beginning and 73.0MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 34123.33ms. Allocated memory was 165.7MB in the beginning and 375.4MB in the end (delta: 209.7MB). Free memory was 71.9MB in the beginning and 162.8MB in the end (delta: -90.9MB). Peak memory consumption was 118.8MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 375.4MB. Free memory is still 162.8MB. 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 101, overapproximation of bitwiseOr at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L22] unsigned short int var_1_1 = 128; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned short int var_1_3 = 25; [L26] unsigned short int var_1_3 = 25; [L27] unsigned short int* var_1_3_Pointer = &(var_1_3); [L28] unsigned char var_1_4 = 4; [L28] unsigned char var_1_4 = 4; [L29] unsigned char* var_1_4_Pointer = &(var_1_4); [L30] double var_1_8 = 127.625; [L30] double var_1_8 = 127.625; [L31] double* var_1_8_Pointer = &(var_1_8); [L32] double var_1_10 = 0.8; [L32] double var_1_10 = 0.8; [L33] double* var_1_10_Pointer = &(var_1_10); [L34] double var_1_11 = 128.75; [L34] double var_1_11 = 128.75; [L35] double* var_1_11_Pointer = &(var_1_11); [L36] double var_1_12 = 24.8; [L36] double var_1_12 = 24.8; [L37] double* var_1_12_Pointer = &(var_1_12); [L38] signed short int var_1_14 = -128; [L38] signed short int var_1_14 = -128; [L39] signed short int* var_1_14_Pointer = &(var_1_14); [L40] signed char var_1_15 = 64; [L40] signed char var_1_15 = 64; [L41] signed char* var_1_15_Pointer = &(var_1_15); [L42] signed char var_1_16 = 5; [L42] signed char var_1_16 = 5; [L43] signed char* var_1_16_Pointer = &(var_1_16); [L44] double var_1_17 = 1.5; [L44] double var_1_17 = 1.5; [L45] double* var_1_17_Pointer = &(var_1_17); [L46] unsigned short int last_1_var_1_1 = 128; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR \read(var_1_1) [L98] last_1_var_1_1 = var_1_1 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L79] var_1_2 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L80] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L80] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L81] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L81] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L81] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L82] var_1_3 = __VERIFIER_nondet_ushort() [L83] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L83] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L83] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L84] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L84] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L84] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L85] var_1_4 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L87] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L87] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L87] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L88] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L88] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L88] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L89] var_1_10 = __VERIFIER_nondet_double() [L90] EXPR \read(var_1_10) [L90] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L90] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F [L90] EXPR \read(var_1_10) [L90] EXPR var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L90] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L90] EXPR (var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L90] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L90] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L91] var_1_11 = __VERIFIER_nondet_double() [L92] EXPR \read(var_1_11) [L92] EXPR var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] EXPR var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F [L92] EXPR \read(var_1_11) [L92] EXPR var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] EXPR (var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] EXPR (var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L93] var_1_16 = __VERIFIER_nondet_char() [L94] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L94] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L94] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L95] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L95] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L95] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L109] RET updateVariables() [L110] CALL step() [L50] (*(var_1_14_Pointer)) = 200 [L51] EXPR \read(*var_1_16_Pointer) [L51] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L52] EXPR \read(*var_1_10_Pointer) [L52] (*(var_1_17_Pointer)) = (*(var_1_10_Pointer)) [L53] EXPR \read(*var_1_3_Pointer) [L53] EXPR \read(*var_1_4_Pointer) [L53] signed long int stepLocal_0 = (*(var_1_3_Pointer)) / (*(var_1_4_Pointer)); [L54] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L54] COND FALSE !((*(var_1_2_Pointer))) [L57] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L57] EXPR (((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1)) [L57] EXPR (((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L57] COND TRUE stepLocal_0 >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1)))) [L58] EXPR \read(*var_1_4_Pointer) [L58] (*(var_1_1_Pointer)) = (*(var_1_4_Pointer)) [L63] EXPR \read(*var_1_3_Pointer) [L63] EXPR \read(*var_1_1_Pointer) [L63] signed long int stepLocal_2 = (*(var_1_3_Pointer)) + (*(var_1_1_Pointer)); [L64] EXPR \read(*var_1_14_Pointer) [L64] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L64] EXPR (*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_2=1, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L64] signed long int stepLocal_1 = (*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)); [L65] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L65] COND FALSE !((*(var_1_15_Pointer)) <= stepLocal_2) [L72] EXPR \read(*var_1_10_Pointer) [L72] (*(var_1_8_Pointer)) = (*(var_1_10_Pointer)) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L74] COND FALSE !((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer))))) [L101] EXPR \read(*var_1_3_Pointer) [L101] EXPR \read(*var_1_4_Pointer) [L101] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1)) [L101] EXPR (((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))) [L101] EXPR \read(*var_1_1_Pointer) [L101] EXPR \read(*var_1_4_Pointer) [L101] EXPR (((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer))))) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer))))) [L101] EXPR \read(*var_1_15_Pointer) [L101] EXPR \read(*var_1_3_Pointer) [L101] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))) [L101] EXPR \read(*var_1_8_Pointer) [L101] EXPR \read(*var_1_10_Pointer) [L101] EXPR ((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200)) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200)) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR (((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_17_Pointer)) == ((double) (*(var_1_10_Pointer)))) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR ((((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_17_Pointer)) == ((double) (*(var_1_10_Pointer)))) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101-L102] return ((((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) < 0 ) ? -(((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))) : (((((*(var_1_3_Pointer))) < 0 ) ? -((*(var_1_3_Pointer))) : ((*(var_1_3_Pointer))))))))) : ((((*(var_1_3_Pointer)) / (*(var_1_4_Pointer))) >= (((((last_1_var_1_1 * (*(var_1_15_Pointer)))) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * (*(var_1_15_Pointer)))) : ((~ last_1_var_1_1))))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_4_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) && (((*(var_1_15_Pointer)) <= ((*(var_1_3_Pointer)) + (*(var_1_1_Pointer)))) ? (((*(var_1_1_Pointer)) == ((*(var_1_14_Pointer)) ^ (*(var_1_15_Pointer)))) ? ((*(var_1_8_Pointer)) == ((double) ((((((*(var_1_10_Pointer))) < 0 ) ? -((*(var_1_10_Pointer))) : ((*(var_1_10_Pointer))))) + (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_11_Pointer))))) : ((*(var_1_8_Pointer)) == ((double) (*(var_1_10_Pointer)))))) && (((*(var_1_15_Pointer)) > (*(var_1_15_Pointer))) ? ((*(var_1_12_Pointer)) == ((double) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_14_Pointer)) == ((signed short int) 200))) && ((*(var_1_15_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_17_Pointer)) == ((double) (*(var_1_10_Pointer)))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=128, 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_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.9s, OverallIterations: 24, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 42 mSolverCounterUnknown, 4545 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4532 mSDsluCounter, 18007 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14218 mSDsCounter, 384 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4930 IncrementalHoareTripleChecker+Invalid, 5356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 384 mSolverCounterUnsat, 3789 mSDtfsCounter, 4930 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2106 GetRequests, 1825 SyntacticMatches, 5 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1617 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=577occurred in iteration=12, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 1861 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 3520 NumberOfCodeBlocks, 3520 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2969 ConstructedInterpolants, 83 QuantifiedInterpolants, 16070 SizeOfPredicates, 158 NumberOfNonLiveVariables, 4464 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 29 InterpolantComputations, 21 PerfectInterpolantSequences, 5265/6380 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-24 11:42:53,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b8c217deaf7ee4e1e888f4bf55d7496164b7b59b8d275eb1ec0a6f1cdc42f43 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:42:55,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:42:55,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:42:55,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:42:55,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:42:56,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:42:56,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:42:56,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:42:56,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:42:56,021 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:42:56,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:42:56,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:42:56,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:42:56,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:42:56,023 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:42:56,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:42:56,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:42:56,029 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:42:56,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:42:56,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:42:56,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:42:56,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:42:56,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:42:56,031 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:42:56,031 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:42:56,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:42:56,032 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:42:56,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:42:56,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:42:56,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:42:56,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:42:56,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:42:56,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:42:56,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:42:56,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:42:56,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:42:56,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:42:56,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:42:56,039 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:42:56,039 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:42:56,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:42:56,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:42:56,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:42:56,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:42:56,042 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:42:56,042 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b8c217deaf7ee4e1e888f4bf55d7496164b7b59b8d275eb1ec0a6f1cdc42f43 [2024-10-24 11:42:56,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:42:56,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:42:56,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:42:56,414 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:42:56,414 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:42:56,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i [2024-10-24 11:42:57,873 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:42:58,127 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:42:58,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-83.i [2024-10-24 11:42:58,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cc8d7c6e/c6b72fdc9f774d7e996a1c1ffffa9b42/FLAG70338e782 [2024-10-24 11:42:58,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cc8d7c6e/c6b72fdc9f774d7e996a1c1ffffa9b42 [2024-10-24 11:42:58,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:42:58,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:42:58,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:42:58,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:42:58,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:42:58,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c95865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58, skipping insertion in model container [2024-10-24 11:42:58,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:42:58,394 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-83.i[916,929] [2024-10-24 11:42:58,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:42:58,490 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:42:58,503 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-83.i[916,929] [2024-10-24 11:42:58,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:42:58,567 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:42:58,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58 WrapperNode [2024-10-24 11:42:58,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:42:58,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:42:58,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:42:58,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:42:58,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,647 INFO L138 Inliner]: procedures = 33, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 522 [2024-10-24 11:42:58,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:42:58,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:42:58,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:42:58,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:42:58,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,711 INFO L175 MemorySlicer]: Split 130 memory accesses to 13 slices as follows [2, 12, 6, 28, 9, 7, 20, 14, 3, 5, 15, 6, 3]. 22 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 3, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1]. [2024-10-24 11:42:58,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:42:58,781 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:42:58,781 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:42:58,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:42:58,782 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58" (1/1) ... [2024-10-24 11:42:58,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:42:58,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:42:58,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:42:58,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:42:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:42:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:42:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:42:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-24 11:42:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-24 11:42:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-24 11:42:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-24 11:42:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-24 11:42:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-10-24 11:42:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-10-24 11:42:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-10-24 11:42:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-10-24 11:42:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-10-24 11:42:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-10-24 11:42:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:42:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:42:58,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-24 11:42:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-24 11:42:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-24 11:42:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-24 11:42:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-24 11:42:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-10-24 11:42:58,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-10-24 11:42:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-10-24 11:42:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-10-24 11:42:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-10-24 11:42:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-10-24 11:42:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:42:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:42:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:42:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:42:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:42:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 11:42:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-24 11:42:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-24 11:42:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-24 11:42:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-24 11:42:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-24 11:42:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-24 11:42:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-24 11:42:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:42:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:42:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-24 11:42:58,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-24 11:42:58,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-24 11:42:58,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-24 11:42:58,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-24 11:42:58,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-24 11:42:58,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-24 11:42:58,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-24 11:42:58,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-24 11:42:58,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-24 11:42:58,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-24 11:42:58,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:42:58,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:42:58,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:42:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:42:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:42:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 11:42:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-24 11:42:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-24 11:42:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-24 11:42:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-24 11:42:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-24 11:42:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-24 11:42:58,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-24 11:42:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:42:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:42:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-24 11:42:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-24 11:42:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-24 11:42:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-24 11:42:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-24 11:42:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-10-24 11:42:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-10-24 11:42:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-10-24 11:42:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-10-24 11:42:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-10-24 11:42:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-10-24 11:42:58,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:42:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:42:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-24 11:42:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-24 11:42:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-24 11:42:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-24 11:42:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-24 11:42:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-24 11:42:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-24 11:42:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-24 11:42:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-24 11:42:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-24 11:42:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-24 11:42:58,896 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:42:58,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:42:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:42:58,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:42:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:42:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:42:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:42:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:42:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:42:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 11:42:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-24 11:42:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-24 11:42:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-24 11:42:58,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-24 11:42:58,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-24 11:42:58,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-24 11:42:58,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-24 11:42:58,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:42:58,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:42:58,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-24 11:42:58,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-24 11:42:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-24 11:42:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-24 11:42:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-24 11:42:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-24 11:42:58,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-24 11:42:58,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-24 11:42:58,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-24 11:42:58,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-24 11:42:58,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-24 11:42:59,163 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:42:59,166 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:43:00,161 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-24 11:43:00,161 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:43:00,221 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:43:00,224 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:43:00,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:43:00 BoogieIcfgContainer [2024-10-24 11:43:00,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:43:00,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:43:00,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:43:00,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:43:00,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:42:58" (1/3) ... [2024-10-24 11:43:00,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517471d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:43:00, skipping insertion in model container [2024-10-24 11:43:00,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:42:58" (2/3) ... [2024-10-24 11:43:00,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517471d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:43:00, skipping insertion in model container [2024-10-24 11:43:00,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:43:00" (3/3) ... [2024-10-24 11:43:00,234 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-83.i [2024-10-24 11:43:00,253 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:43:00,253 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:43:00,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:43:00,333 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;@36661321, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:43:00,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:43:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 83 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:43:00,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:43:00,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:00,355 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:43:00,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:00,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:00,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2062193672, now seen corresponding path program 1 times [2024-10-24 11:43:00,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:00,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554934365] [2024-10-24 11:43:00,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:00,384 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-24 11:43:00,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:00,388 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:00,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:43:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:00,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:43:00,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-24 11:43:00,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:43:00,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:00,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554934365] [2024-10-24 11:43:00,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554934365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:00,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:00,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:43:00,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993648196] [2024-10-24 11:43:00,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:00,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:43:00,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:00,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:43:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:43:00,988 INFO L87 Difference]: Start difference. First operand has 96 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 83 states have internal predecessors, (122), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:01,063 INFO L93 Difference]: Finished difference Result 189 states and 297 transitions. [2024-10-24 11:43:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:43:01,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-24 11:43:01,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:01,075 INFO L225 Difference]: With dead ends: 189 [2024-10-24 11:43:01,075 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 11:43:01,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-24 11:43:01,085 INFO L432 NwaCegarLoop]: 129 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, 129 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-24 11:43:01,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:43:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 11:43:01,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-24 11:43:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:43:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2024-10-24 11:43:01,130 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 99 [2024-10-24 11:43:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:01,130 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2024-10-24 11:43:01,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2024-10-24 11:43:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:43:01,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:01,136 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:43:01,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:43:01,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:01,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:01,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1908266534, now seen corresponding path program 1 times [2024-10-24 11:43:01,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:01,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906549113] [2024-10-24 11:43:01,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:01,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:01,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:01,345 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:01,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:43:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:01,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:43:01,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-24 11:43:01,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:43:01,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:01,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906549113] [2024-10-24 11:43:01,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906549113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:01,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:01,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:43:01,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684948915] [2024-10-24 11:43:01,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:01,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:43:01,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:01,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:43:01,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:43:01,853 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:43:02,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:02,005 INFO L93 Difference]: Finished difference Result 189 states and 268 transitions. [2024-10-24 11:43:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:43:02,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2024-10-24 11:43:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:02,007 INFO L225 Difference]: With dead ends: 189 [2024-10-24 11:43:02,007 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 11:43:02,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 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-24 11:43:02,009 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 374 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-24 11:43:02,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 374 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 11:43:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-24 11:43:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:43:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2024-10-24 11:43:02,028 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 99 [2024-10-24 11:43:02,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:02,030 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2024-10-24 11:43:02,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:43:02,030 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2024-10-24 11:43:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:43:02,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:02,035 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:43:02,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:43:02,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:02,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:02,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:02,237 INFO L85 PathProgramCache]: Analyzing trace with hash 458428060, now seen corresponding path program 1 times [2024-10-24 11:43:02,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:02,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775149878] [2024-10-24 11:43:02,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:02,238 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-24 11:43:02,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:02,239 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:02,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:43:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:02,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:43:02,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:02,770 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-24 11:43:03,036 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 13 [2024-10-24 11:43:03,041 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 13 treesize of output 9 [2024-10-24 11:43:03,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-24 11:43:03,111 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:43:03,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:43:03,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:03,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775149878] [2024-10-24 11:43:03,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775149878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:03,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:03,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:43:03,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819721352] [2024-10-24 11:43:03,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:03,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:43:03,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:03,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:43:03,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:43:03,115 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:04,005 INFO L93 Difference]: Finished difference Result 373 states and 526 transitions. [2024-10-24 11:43:04,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:43:04,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-24 11:43:04,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:04,016 INFO L225 Difference]: With dead ends: 373 [2024-10-24 11:43:04,017 INFO L226 Difference]: Without dead ends: 278 [2024-10-24 11:43:04,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:43:04,019 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 256 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:04,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1104 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:43:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-24 11:43:04,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 140. [2024-10-24 11:43:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 115 states have (on average 1.3391304347826087) internal successors, (154), 115 states have internal predecessors, (154), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:43:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 198 transitions. [2024-10-24 11:43:04,042 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 198 transitions. Word has length 99 [2024-10-24 11:43:04,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:04,043 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 198 transitions. [2024-10-24 11:43:04,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 198 transitions. [2024-10-24 11:43:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:43:04,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:04,045 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:43:04,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:43:04,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:04,246 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:04,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:04,247 INFO L85 PathProgramCache]: Analyzing trace with hash 324414554, now seen corresponding path program 1 times [2024-10-24 11:43:04,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:04,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373187237] [2024-10-24 11:43:04,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:04,248 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-24 11:43:04,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:04,251 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:04,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:43:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:04,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:43:04,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:04,677 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-24 11:43:04,833 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 13 [2024-10-24 11:43:04,838 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 13 treesize of output 9 [2024-10-24 11:43:04,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-24 11:43:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:43:05,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:43:05,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:05,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373187237] [2024-10-24 11:43:05,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373187237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:05,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:05,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:43:05,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998792256] [2024-10-24 11:43:05,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:05,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:43:05,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:05,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:43:05,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:43:05,109 INFO L87 Difference]: Start difference. First operand 140 states and 198 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:06,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:06,658 INFO L93 Difference]: Finished difference Result 332 states and 466 transitions. [2024-10-24 11:43:06,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:43:06,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-24 11:43:06,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:06,661 INFO L225 Difference]: With dead ends: 332 [2024-10-24 11:43:06,661 INFO L226 Difference]: Without dead ends: 237 [2024-10-24 11:43:06,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:43:06,664 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 198 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:06,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 644 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 11:43:06,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-24 11:43:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 157. [2024-10-24 11:43:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 132 states have (on average 1.3409090909090908) internal successors, (177), 132 states have internal predecessors, (177), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:43:06,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 221 transitions. [2024-10-24 11:43:06,686 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 221 transitions. Word has length 99 [2024-10-24 11:43:06,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:06,687 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 221 transitions. [2024-10-24 11:43:06,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 221 transitions. [2024-10-24 11:43:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:43:06,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:06,689 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:43:06,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 11:43:06,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:06,890 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:06,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:06,890 INFO L85 PathProgramCache]: Analyzing trace with hash -696653800, now seen corresponding path program 1 times [2024-10-24 11:43:06,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:06,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259188689] [2024-10-24 11:43:06,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:06,892 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-24 11:43:06,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:06,895 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:06,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:43:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:07,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:43:07,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:07,644 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 19 treesize of output 11 [2024-10-24 11:43:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 4 proven. 132 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:43:07,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:43:08,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:08,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259188689] [2024-10-24 11:43:08,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259188689] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:08,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:08,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 11:43:08,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633751535] [2024-10-24 11:43:08,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:08,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:43:08,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:08,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:43:08,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:43:08,004 INFO L87 Difference]: Start difference. First operand 157 states and 221 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:08,240 INFO L93 Difference]: Finished difference Result 253 states and 357 transitions. [2024-10-24 11:43:08,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:43:08,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-24 11:43:08,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:08,244 INFO L225 Difference]: With dead ends: 253 [2024-10-24 11:43:08,244 INFO L226 Difference]: Without dead ends: 158 [2024-10-24 11:43:08,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:43:08,246 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:08,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:43:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-24 11:43:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-10-24 11:43:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 133 states have (on average 1.3383458646616542) internal successors, (178), 133 states have internal predecessors, (178), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:43:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 222 transitions. [2024-10-24 11:43:08,263 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 222 transitions. Word has length 99 [2024-10-24 11:43:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:08,263 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 222 transitions. [2024-10-24 11:43:08,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 222 transitions. [2024-10-24 11:43:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:43:08,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:08,266 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:43:08,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-24 11:43:08,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:08,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:08,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:08,467 INFO L85 PathProgramCache]: Analyzing trace with hash 583209878, now seen corresponding path program 1 times [2024-10-24 11:43:08,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:08,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630733474] [2024-10-24 11:43:08,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:08,468 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-24 11:43:08,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:08,469 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:08,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:43:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:08,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:43:08,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:43:08,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:43:08,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:08,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630733474] [2024-10-24 11:43:08,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630733474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:08,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:08,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:43:08,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803553020] [2024-10-24 11:43:08,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:08,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:43:08,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:08,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:43:08,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:43:08,848 INFO L87 Difference]: Start difference. First operand 158 states and 222 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:08,967 INFO L93 Difference]: Finished difference Result 259 states and 364 transitions. [2024-10-24 11:43:08,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:43:08,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-24 11:43:08,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:08,969 INFO L225 Difference]: With dead ends: 259 [2024-10-24 11:43:08,969 INFO L226 Difference]: Without dead ends: 163 [2024-10-24 11:43:08,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 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-24 11:43:08,970 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:08,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 486 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:08,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-24 11:43:08,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2024-10-24 11:43:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 137 states have internal predecessors, (182), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:43:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 226 transitions. [2024-10-24 11:43:08,981 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 226 transitions. Word has length 99 [2024-10-24 11:43:08,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:08,982 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 226 transitions. [2024-10-24 11:43:08,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 226 transitions. [2024-10-24 11:43:08,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:43:08,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:08,984 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:43:09,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 11:43:09,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:09,185 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:09,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:09,185 INFO L85 PathProgramCache]: Analyzing trace with hash -226136748, now seen corresponding path program 1 times [2024-10-24 11:43:09,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:09,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578105348] [2024-10-24 11:43:09,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:09,186 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-24 11:43:09,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:09,187 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:09,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 11:43:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:09,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:43:09,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:43:09,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:43:09,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:09,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578105348] [2024-10-24 11:43:09,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578105348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:09,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:09,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:43:09,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528691891] [2024-10-24 11:43:09,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:09,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:43:09,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:09,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:43:09,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:43:09,546 INFO L87 Difference]: Start difference. First operand 162 states and 226 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:09,645 INFO L93 Difference]: Finished difference Result 265 states and 369 transitions. [2024-10-24 11:43:09,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:43:09,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-24 11:43:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:09,647 INFO L225 Difference]: With dead ends: 265 [2024-10-24 11:43:09,647 INFO L226 Difference]: Without dead ends: 165 [2024-10-24 11:43:09,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:43:09,649 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:09,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 598 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-24 11:43:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2024-10-24 11:43:09,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 139 states have (on average 1.3237410071942446) internal successors, (184), 139 states have internal predecessors, (184), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:43:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 228 transitions. [2024-10-24 11:43:09,661 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 228 transitions. Word has length 99 [2024-10-24 11:43:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:09,661 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 228 transitions. [2024-10-24 11:43:09,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 228 transitions. [2024-10-24 11:43:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:43:09,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:09,663 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:43:09,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 11:43:09,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:09,864 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:09,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:09,864 INFO L85 PathProgramCache]: Analyzing trace with hash -168878446, now seen corresponding path program 1 times [2024-10-24 11:43:09,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:09,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774363136] [2024-10-24 11:43:09,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:09,865 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-24 11:43:09,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:09,866 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:09,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 11:43:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:10,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:43:10,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:43:10,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:43:10,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774363136] [2024-10-24 11:43:10,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774363136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:10,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:10,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:43:10,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716309056] [2024-10-24 11:43:10,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:10,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:43:10,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:10,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:43:10,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:43:10,247 INFO L87 Difference]: Start difference. First operand 164 states and 228 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:10,388 INFO L93 Difference]: Finished difference Result 269 states and 373 transitions. [2024-10-24 11:43:10,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:43:10,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-24 11:43:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:10,392 INFO L225 Difference]: With dead ends: 269 [2024-10-24 11:43:10,392 INFO L226 Difference]: Without dead ends: 167 [2024-10-24 11:43:10,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 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-24 11:43:10,393 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:10,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 712 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-24 11:43:10,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2024-10-24 11:43:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 141 states have internal predecessors, (186), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 11:43:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 230 transitions. [2024-10-24 11:43:10,408 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 230 transitions. Word has length 99 [2024-10-24 11:43:10,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:10,410 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 230 transitions. [2024-10-24 11:43:10,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:10,410 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2024-10-24 11:43:10,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:43:10,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:10,411 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:43:10,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 11:43:10,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:10,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:10,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:10,612 INFO L85 PathProgramCache]: Analyzing trace with hash -168818864, now seen corresponding path program 1 times [2024-10-24 11:43:10,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:10,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331373478] [2024-10-24 11:43:10,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:10,613 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-24 11:43:10,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:10,614 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:10,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 11:43:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:10,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 11:43:10,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:11,099 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 14 [2024-10-24 11:43:11,115 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 13 [2024-10-24 11:43:11,263 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 72 treesize of output 56 [2024-10-24 11:43:11,269 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 67 treesize of output 47 [2024-10-24 11:43:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-24 11:43:11,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:11,443 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 14 [2024-10-24 11:43:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:43:11,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331373478] [2024-10-24 11:43:11,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331373478] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:11,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:11,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2024-10-24 11:43:11,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787620874] [2024-10-24 11:43:11,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:11,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:43:11,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:11,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:43:11,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:43:11,540 INFO L87 Difference]: Start difference. First operand 166 states and 230 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:11,996 INFO L93 Difference]: Finished difference Result 356 states and 485 transitions. [2024-10-24 11:43:11,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:43:11,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-24 11:43:11,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:12,000 INFO L225 Difference]: With dead ends: 356 [2024-10-24 11:43:12,000 INFO L226 Difference]: Without dead ends: 252 [2024-10-24 11:43:12,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:43:12,001 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 222 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:12,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 791 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:43:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-24 11:43:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 249. [2024-10-24 11:43:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 218 states have (on average 1.31651376146789) internal successors, (287), 219 states have internal predecessors, (287), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 11:43:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 339 transitions. [2024-10-24 11:43:12,014 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 339 transitions. Word has length 99 [2024-10-24 11:43:12,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:12,014 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 339 transitions. [2024-10-24 11:43:12,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 339 transitions. [2024-10-24 11:43:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:43:12,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:12,016 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:43:12,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-24 11:43:12,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:12,217 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:12,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:12,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1974257198, now seen corresponding path program 1 times [2024-10-24 11:43:12,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:12,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126410874] [2024-10-24 11:43:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:12,218 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-24 11:43:12,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:12,219 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:12,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 11:43:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:12,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:43:12,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:12,852 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 13 [2024-10-24 11:43:12,855 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 24 treesize of output 16 [2024-10-24 11:43:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 4 proven. 132 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:43:13,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:13,355 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 19 treesize of output 15 [2024-10-24 11:43:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:43:13,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:13,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126410874] [2024-10-24 11:43:13,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126410874] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:13,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:13,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-10-24 11:43:13,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127254892] [2024-10-24 11:43:13,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:13,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:43:13,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:13,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:43:13,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:43:13,434 INFO L87 Difference]: Start difference. First operand 249 states and 339 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:13,606 INFO L93 Difference]: Finished difference Result 441 states and 603 transitions. [2024-10-24 11:43:13,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:43:13,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-10-24 11:43:13,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:13,611 INFO L225 Difference]: With dead ends: 441 [2024-10-24 11:43:13,612 INFO L226 Difference]: Without dead ends: 260 [2024-10-24 11:43:13,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:43:13,614 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 25 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:13,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 394 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-24 11:43:13,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 250. [2024-10-24 11:43:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 219 states have (on average 1.3105022831050228) internal successors, (287), 220 states have internal predecessors, (287), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 11:43:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 339 transitions. [2024-10-24 11:43:13,629 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 339 transitions. Word has length 99 [2024-10-24 11:43:13,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:13,630 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 339 transitions. [2024-10-24 11:43:13,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:13,630 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 339 transitions. [2024-10-24 11:43:13,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:43:13,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:13,631 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:43:13,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 11:43:13,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:13,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:13,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:13,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1106097574, now seen corresponding path program 1 times [2024-10-24 11:43:13,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:13,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469542730] [2024-10-24 11:43:13,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:13,833 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-24 11:43:13,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:13,834 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:13,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 11:43:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:14,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 11:43:14,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:14,233 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-24 11:43:15,091 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 19 treesize of output 11 [2024-10-24 11:43:15,231 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 33 treesize of output 25 [2024-10-24 11:43:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 4 proven. 132 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:43:15,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:17,465 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-24 11:43:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:43:17,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:17,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469542730] [2024-10-24 11:43:17,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469542730] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:17,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:17,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2024-10-24 11:43:17,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331744009] [2024-10-24 11:43:17,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:17,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:43:17,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:17,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:43:17,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:43:17,547 INFO L87 Difference]: Start difference. First operand 250 states and 339 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:21,805 INFO L93 Difference]: Finished difference Result 535 states and 725 transitions. [2024-10-24 11:43:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:43:21,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-10-24 11:43:21,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:21,814 INFO L225 Difference]: With dead ends: 535 [2024-10-24 11:43:21,814 INFO L226 Difference]: Without dead ends: 362 [2024-10-24 11:43:21,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:43:21,816 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 61 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:21,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 676 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-24 11:43:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-24 11:43:21,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2024-10-24 11:43:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 243 states have (on average 1.337448559670782) internal successors, (325), 244 states have internal predecessors, (325), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 11:43:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 377 transitions. [2024-10-24 11:43:21,830 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 377 transitions. Word has length 100 [2024-10-24 11:43:21,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:21,830 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 377 transitions. [2024-10-24 11:43:21,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:21,831 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 377 transitions. [2024-10-24 11:43:21,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:43:21,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:21,832 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:43:21,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-24 11:43:22,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:22,033 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:22,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:22,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2043019550, now seen corresponding path program 1 times [2024-10-24 11:43:22,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:22,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785844166] [2024-10-24 11:43:22,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:22,034 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-24 11:43:22,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:22,035 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:22,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 11:43:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:22,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 11:43:22,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:22,422 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-24 11:43:22,930 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 13 [2024-10-24 11:43:22,934 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 24 treesize of output 16 [2024-10-24 11:43:23,335 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 33 treesize of output 25 [2024-10-24 11:43:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 4 proven. 132 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:43:23,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:23,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 28 treesize of output 20 [2024-10-24 11:43:23,931 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 22 treesize of output 18 [2024-10-24 11:43:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:43:24,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:24,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785844166] [2024-10-24 11:43:24,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785844166] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:24,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:43:24,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-24 11:43:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102982047] [2024-10-24 11:43:24,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:24,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:43:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:24,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:43:24,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:43:24,013 INFO L87 Difference]: Start difference. First operand 274 states and 377 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:25,008 INFO L93 Difference]: Finished difference Result 459 states and 631 transitions. [2024-10-24 11:43:25,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:43:25,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-10-24 11:43:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:25,012 INFO L225 Difference]: With dead ends: 459 [2024-10-24 11:43:25,012 INFO L226 Difference]: Without dead ends: 260 [2024-10-24 11:43:25,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:43:25,014 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 26 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:25,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 516 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:43:25,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-24 11:43:25,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-10-24 11:43:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 229 states have (on average 1.3187772925764192) internal successors, (302), 230 states have internal predecessors, (302), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 11:43:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 354 transitions. [2024-10-24 11:43:25,025 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 354 transitions. Word has length 100 [2024-10-24 11:43:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:25,026 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 354 transitions. [2024-10-24 11:43:25,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 354 transitions. [2024-10-24 11:43:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 11:43:25,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:25,027 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:43:25,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-24 11:43:25,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:25,228 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:25,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:25,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1246646184, now seen corresponding path program 1 times [2024-10-24 11:43:25,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:25,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467172382] [2024-10-24 11:43:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:25,229 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-24 11:43:25,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:25,231 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:25,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 11:43:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:25,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:43:25,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:25,555 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-24 11:43:25,837 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 24 treesize of output 16 [2024-10-24 11:43:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:43:25,912 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:43:25,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:43:25,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467172382] [2024-10-24 11:43:25,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467172382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:25,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:25,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:43:25,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986358150] [2024-10-24 11:43:25,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:25,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:43:25,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:43:25,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:43:25,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:43:25,914 INFO L87 Difference]: Start difference. First operand 260 states and 354 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:27,038 INFO L93 Difference]: Finished difference Result 607 states and 822 transitions. [2024-10-24 11:43:27,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:43:27,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-10-24 11:43:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:27,040 INFO L225 Difference]: With dead ends: 607 [2024-10-24 11:43:27,041 INFO L226 Difference]: Without dead ends: 422 [2024-10-24 11:43:27,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:43:27,042 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 204 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:27,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 674 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:43:27,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-10-24 11:43:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 263. [2024-10-24 11:43:27,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 232 states have (on average 1.3232758620689655) internal successors, (307), 233 states have internal predecessors, (307), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 11:43:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 359 transitions. [2024-10-24 11:43:27,057 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 359 transitions. Word has length 100 [2024-10-24 11:43:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:27,058 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 359 transitions. [2024-10-24 11:43:27,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:43:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 359 transitions. [2024-10-24 11:43:27,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:43:27,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:27,059 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:43:27,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-24 11:43:27,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:43:27,260 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:27,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:27,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1548331237, now seen corresponding path program 1 times [2024-10-24 11:43:27,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:43:27,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292793375] [2024-10-24 11:43:27,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:27,261 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-24 11:43:27,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:43:27,262 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:43:27,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process