./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX --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 2761ad5b8b5d660ea43c0926578149a1a33205183f80a80f035b1bec4306cb62 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:29:26,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:29:26,619 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:29:26,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:29:26,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:29:26,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:29:26,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:29:26,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:29:26,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:29:26,662 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:29:26,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:29:26,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:29:26,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:29:26,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:29:26,665 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:29:26,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:29:26,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:29:26,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:29:26,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:29:26,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:29:26,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:29:26,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:29:26,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:29:26,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:29:26,671 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:29:26,671 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:29:26,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:29:26,672 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:29:26,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:29:26,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:29:26,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:29:26,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:29:26,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:26,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:29:26,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:29:26,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:29:26,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:29:26,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:29:26,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:29:26,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:29:26,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:29:26,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:29:26,682 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX 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 -> 2761ad5b8b5d660ea43c0926578149a1a33205183f80a80f035b1bec4306cb62 [2024-11-08 17:29:27,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:29:27,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:29:27,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:29:27,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:29:27,132 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:29:27,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i Unable to find full path for "g++" [2024-11-08 17:29:29,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:29:29,767 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:29:29,768 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i [2024-11-08 17:29:29,780 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/data/be875e1d5/9bb96233f0cb496a8f7179a7c48f2442/FLAG1d24018e5 [2024-11-08 17:29:30,046 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/data/be875e1d5/9bb96233f0cb496a8f7179a7c48f2442 [2024-11-08 17:29:30,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:29:30,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:29:30,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:30,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:29:30,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:29:30,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:30" (1/1) ... [2024-11-08 17:29:30,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71689efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:30, skipping insertion in model container [2024-11-08 17:29:30,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:30" (1/1) ... [2024-11-08 17:29:30,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:29:30,373 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i[916,929] [2024-11-08 17:29:30,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:30,522 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:29:30,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i[916,929] [2024-11-08 17:29:30,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:29:30,676 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:29:30,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:30 WrapperNode [2024-11-08 17:29:30,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:29:30,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:30,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:29:30,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:29:30,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:30" (1/1) ... [2024-11-08 17:29:30,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:30" (1/1) ... [2024-11-08 17:29:30,790 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2024-11-08 17:29:30,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:29:30,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:29:30,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:29:30,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:29:30,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:30" (1/1) ... [2024-11-08 17:29:30,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:30" (1/1) ... [2024-11-08 17:29:30,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:30" (1/1) ... [2024-11-08 17:29:30,855 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:29:30,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:30" (1/1) ... [2024-11-08 17:29:30,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:30" (1/1) ... [2024-11-08 17:29:30,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:30" (1/1) ... [2024-11-08 17:29:30,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:30" (1/1) ... [2024-11-08 17:29:30,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:30" (1/1) ... [2024-11-08 17:29:30,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:30" (1/1) ... [2024-11-08 17:29:30,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:29:30,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:29:30,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:29:30,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:29:30,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:30" (1/1) ... [2024-11-08 17:29:30,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:29:30,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:29:30,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:29:30,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:29:31,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:29:31,014 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:29:31,015 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:29:31,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:29:31,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:29:31,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:29:31,137 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:29:31,141 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:29:32,202 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-08 17:29:32,204 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:29:32,228 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:29:32,230 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:29:32,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:32 BoogieIcfgContainer [2024-11-08 17:29:32,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:29:32,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:29:32,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:29:32,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:29:32,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:29:30" (1/3) ... [2024-11-08 17:29:32,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c83490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:32, skipping insertion in model container [2024-11-08 17:29:32,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:30" (2/3) ... [2024-11-08 17:29:32,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c83490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:32, skipping insertion in model container [2024-11-08 17:29:32,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:32" (3/3) ... [2024-11-08 17:29:32,250 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-59.i [2024-11-08 17:29:32,276 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:29:32,277 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:29:32,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:29:32,376 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;@4e786a25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:29:32,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:29:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 87 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 17:29:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 17:29:32,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:32,406 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:32,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:32,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:32,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1629580410, now seen corresponding path program 1 times [2024-11-08 17:29:32,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:32,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686382553] [2024-11-08 17:29:32,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:29:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:29:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:29:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:29:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:32,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:29:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:29:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:29:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:29:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:29:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:29:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:29:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:29:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:29:33,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:33,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686382553] [2024-11-08 17:29:33,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686382553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:33,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:33,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:29:33,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238815426] [2024-11-08 17:29:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:33,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:29:33,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:33,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:29:33,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:29:33,112 INFO L87 Difference]: Start difference. First operand has 110 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 87 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:29:33,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:33,173 INFO L93 Difference]: Finished difference Result 213 states and 361 transitions. [2024-11-08 17:29:33,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:29:33,176 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 148 [2024-11-08 17:29:33,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:33,215 INFO L225 Difference]: With dead ends: 213 [2024-11-08 17:29:33,216 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 17:29:33,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:29:33,224 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:33,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:33,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 17:29:33,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-08 17:29:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 83 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 17:29:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 165 transitions. [2024-11-08 17:29:33,305 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 165 transitions. Word has length 148 [2024-11-08 17:29:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:33,306 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 165 transitions. [2024-11-08 17:29:33,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:29:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 165 transitions. [2024-11-08 17:29:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 17:29:33,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:33,312 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:33,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:29:33,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:33,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:33,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2007125964, now seen corresponding path program 1 times [2024-11-08 17:29:33,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:33,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991893854] [2024-11-08 17:29:33,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:33,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:29:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:29:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:29:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:29:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:29:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:29:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:29:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:29:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:29:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:29:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:29:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:29:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:29:33,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:33,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991893854] [2024-11-08 17:29:33,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991893854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:33,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:33,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:29:33,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750258908] [2024-11-08 17:29:33,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:33,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:29:33,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:33,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:29:33,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:29:33,742 INFO L87 Difference]: Start difference. First operand 106 states and 165 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:33,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:33,919 INFO L93 Difference]: Finished difference Result 309 states and 483 transitions. [2024-11-08 17:29:33,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:29:33,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 148 [2024-11-08 17:29:33,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:33,924 INFO L225 Difference]: With dead ends: 309 [2024-11-08 17:29:33,925 INFO L226 Difference]: Without dead ends: 206 [2024-11-08 17:29:33,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-11-08 17:29:33,927 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 146 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:33,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 386 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:29:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-08 17:29:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2024-11-08 17:29:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 159 states have (on average 1.4528301886792452) internal successors, (231), 159 states have internal predecessors, (231), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 17:29:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 315 transitions. [2024-11-08 17:29:33,971 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 315 transitions. Word has length 148 [2024-11-08 17:29:33,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:33,976 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 315 transitions. [2024-11-08 17:29:33,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:33,977 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 315 transitions. [2024-11-08 17:29:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 17:29:33,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:33,984 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:33,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:29:33,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:33,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:33,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2141139470, now seen corresponding path program 1 times [2024-11-08 17:29:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:33,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624841038] [2024-11-08 17:29:33,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:33,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:29:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:29:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:29:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:29:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:29:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:29:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:29:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:29:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:29:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:29:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:29:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:29:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:29:34,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:34,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624841038] [2024-11-08 17:29:34,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624841038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:34,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:34,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:29:34,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440887023] [2024-11-08 17:29:34,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:34,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:29:34,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:34,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:29:34,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:29:34,415 INFO L87 Difference]: Start difference. First operand 204 states and 315 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:34,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:34,552 INFO L93 Difference]: Finished difference Result 408 states and 630 transitions. [2024-11-08 17:29:34,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:29:34,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 148 [2024-11-08 17:29:34,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:34,557 INFO L225 Difference]: With dead ends: 408 [2024-11-08 17:29:34,557 INFO L226 Difference]: Without dead ends: 207 [2024-11-08 17:29:34,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-11-08 17:29:34,561 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 144 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:34,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 354 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:29:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-08 17:29:34,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2024-11-08 17:29:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 160 states have (on average 1.4125) internal successors, (226), 160 states have internal predecessors, (226), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 17:29:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 310 transitions. [2024-11-08 17:29:34,623 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 310 transitions. Word has length 148 [2024-11-08 17:29:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:34,624 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 310 transitions. [2024-11-08 17:29:34,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:34,624 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 310 transitions. [2024-11-08 17:29:34,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 17:29:34,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:34,635 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:34,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:29:34,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:34,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:34,636 INFO L85 PathProgramCache]: Analyzing trace with hash -277716310, now seen corresponding path program 1 times [2024-11-08 17:29:34,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:34,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108343317] [2024-11-08 17:29:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:34,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:29:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:34,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:29:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:29:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:29:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:29:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:29:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:29:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:29:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:29:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:29:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:29:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:29:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:29:35,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:35,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108343317] [2024-11-08 17:29:35,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108343317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:35,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:35,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:29:35,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170301493] [2024-11-08 17:29:35,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:35,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:29:35,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:35,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:29:35,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:29:35,057 INFO L87 Difference]: Start difference. First operand 205 states and 310 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:35,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:35,196 INFO L93 Difference]: Finished difference Result 407 states and 617 transitions. [2024-11-08 17:29:35,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:29:35,197 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 149 [2024-11-08 17:29:35,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:35,200 INFO L225 Difference]: With dead ends: 407 [2024-11-08 17:29:35,200 INFO L226 Difference]: Without dead ends: 205 [2024-11-08 17:29:35,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-11-08 17:29:35,205 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 2 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:35,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 289 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:29:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-08 17:29:35,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-08 17:29:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 160 states have (on average 1.4) internal successors, (224), 160 states have internal predecessors, (224), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 17:29:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 308 transitions. [2024-11-08 17:29:35,241 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 308 transitions. Word has length 149 [2024-11-08 17:29:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:35,242 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 308 transitions. [2024-11-08 17:29:35,242 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 308 transitions. [2024-11-08 17:29:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 17:29:35,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:35,246 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:35,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:29:35,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:35,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:35,247 INFO L85 PathProgramCache]: Analyzing trace with hash -71252923, now seen corresponding path program 1 times [2024-11-08 17:29:35,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:35,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137914388] [2024-11-08 17:29:35,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:35,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:29:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:29:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:29:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:29:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:29:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:29:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:29:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:29:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:29:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:29:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:29:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:29:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:29:35,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:35,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137914388] [2024-11-08 17:29:35,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137914388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:35,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:35,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:35,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012619362] [2024-11-08 17:29:35,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:35,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:35,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:35,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:35,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:35,691 INFO L87 Difference]: Start difference. First operand 205 states and 308 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:35,756 INFO L93 Difference]: Finished difference Result 411 states and 619 transitions. [2024-11-08 17:29:35,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:35,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 150 [2024-11-08 17:29:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:35,762 INFO L225 Difference]: With dead ends: 411 [2024-11-08 17:29:35,762 INFO L226 Difference]: Without dead ends: 209 [2024-11-08 17:29:35,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:35,765 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:35,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 472 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:29:35,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-08 17:29:35,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-11-08 17:29:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 164 states have (on average 1.3902439024390243) internal successors, (228), 164 states have internal predecessors, (228), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 17:29:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 312 transitions. [2024-11-08 17:29:35,804 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 312 transitions. Word has length 150 [2024-11-08 17:29:35,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:35,805 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 312 transitions. [2024-11-08 17:29:35,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 312 transitions. [2024-11-08 17:29:35,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 17:29:35,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:35,808 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:35,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:29:35,809 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:35,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:35,809 INFO L85 PathProgramCache]: Analyzing trace with hash 608805447, now seen corresponding path program 1 times [2024-11-08 17:29:35,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:35,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463909899] [2024-11-08 17:29:35,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:35,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:29:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:29:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:29:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:29:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:29:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:29:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:29:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:29:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:29:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:29:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:29:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:29:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:29:37,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:37,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463909899] [2024-11-08 17:29:37,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463909899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:37,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:37,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:37,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292498185] [2024-11-08 17:29:37,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:37,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:37,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:37,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:37,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:37,367 INFO L87 Difference]: Start difference. First operand 209 states and 312 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:37,984 INFO L93 Difference]: Finished difference Result 543 states and 810 transitions. [2024-11-08 17:29:37,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:37,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 150 [2024-11-08 17:29:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:38,007 INFO L225 Difference]: With dead ends: 543 [2024-11-08 17:29:38,010 INFO L226 Difference]: Without dead ends: 337 [2024-11-08 17:29:38,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:38,012 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 78 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:38,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 323 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:29:38,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-08 17:29:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 285. [2024-11-08 17:29:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 240 states have (on average 1.425) internal successors, (342), 240 states have internal predecessors, (342), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 17:29:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 426 transitions. [2024-11-08 17:29:38,055 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 426 transitions. Word has length 150 [2024-11-08 17:29:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:38,060 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 426 transitions. [2024-11-08 17:29:38,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:38,061 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 426 transitions. [2024-11-08 17:29:38,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 17:29:38,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:38,065 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:38,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:29:38,066 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:38,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:38,067 INFO L85 PathProgramCache]: Analyzing trace with hash 99332357, now seen corresponding path program 1 times [2024-11-08 17:29:38,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:38,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504322668] [2024-11-08 17:29:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:38,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:29:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:29:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:29:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:29:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:29:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:29:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:29:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:29:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:29:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:29:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:29:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:29:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:29:38,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:38,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504322668] [2024-11-08 17:29:38,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504322668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:38,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:38,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:29:38,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508474194] [2024-11-08 17:29:38,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:38,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:29:38,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:38,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:29:38,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:29:38,579 INFO L87 Difference]: Start difference. First operand 285 states and 426 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:38,924 INFO L93 Difference]: Finished difference Result 888 states and 1322 transitions. [2024-11-08 17:29:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:29:38,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 150 [2024-11-08 17:29:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:38,931 INFO L225 Difference]: With dead ends: 888 [2024-11-08 17:29:38,932 INFO L226 Difference]: Without dead ends: 606 [2024-11-08 17:29:38,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:38,935 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 216 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:38,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 544 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:29:38,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-08 17:29:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 489. [2024-11-08 17:29:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 400 states have (on average 1.405) internal successors, (562), 400 states have internal predecessors, (562), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-08 17:29:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 730 transitions. [2024-11-08 17:29:39,034 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 730 transitions. Word has length 150 [2024-11-08 17:29:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:39,035 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 730 transitions. [2024-11-08 17:29:39,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 730 transitions. [2024-11-08 17:29:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:29:39,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:39,039 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:39,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:29:39,039 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:39,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1805894586, now seen corresponding path program 1 times [2024-11-08 17:29:39,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:39,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746597618] [2024-11-08 17:29:39,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:39,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:29:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:29:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:29:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:29:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:29:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:29:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:29:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:29:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:29:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:29:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:29:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:29:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:43,991 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:29:43,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:43,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746597618] [2024-11-08 17:29:43,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746597618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:43,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:43,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 17:29:43,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997712204] [2024-11-08 17:29:43,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:43,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 17:29:43,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:43,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 17:29:43,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:29:43,995 INFO L87 Difference]: Start difference. First operand 489 states and 730 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:47,693 INFO L93 Difference]: Finished difference Result 1072 states and 1572 transitions. [2024-11-08 17:29:47,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:29:47,694 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 155 [2024-11-08 17:29:47,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:47,700 INFO L225 Difference]: With dead ends: 1072 [2024-11-08 17:29:47,701 INFO L226 Difference]: Without dead ends: 790 [2024-11-08 17:29:47,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:29:47,703 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 870 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:47,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1054 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 17:29:47,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-11-08 17:29:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 567. [2024-11-08 17:29:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 478 states have (on average 1.4121338912133892) internal successors, (675), 478 states have internal predecessors, (675), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-08 17:29:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 843 transitions. [2024-11-08 17:29:47,771 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 843 transitions. Word has length 155 [2024-11-08 17:29:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:47,778 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 843 transitions. [2024-11-08 17:29:47,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:47,778 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 843 transitions. [2024-11-08 17:29:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 17:29:47,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:47,782 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:47,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:29:47,782 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:47,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:47,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1910395967, now seen corresponding path program 1 times [2024-11-08 17:29:47,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:47,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143056487] [2024-11-08 17:29:47,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:47,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:29:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:29:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:29:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:29:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:29:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:29:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:29:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:29:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:29:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:29:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:29:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:29:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:29:48,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:48,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143056487] [2024-11-08 17:29:48,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143056487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:48,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:48,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:29:48,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607110492] [2024-11-08 17:29:48,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:48,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:29:48,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:48,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:29:48,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:48,254 INFO L87 Difference]: Start difference. First operand 567 states and 843 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:48,802 INFO L93 Difference]: Finished difference Result 1407 states and 2091 transitions. [2024-11-08 17:29:48,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:29:48,803 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 155 [2024-11-08 17:29:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:48,809 INFO L225 Difference]: With dead ends: 1407 [2024-11-08 17:29:48,809 INFO L226 Difference]: Without dead ends: 843 [2024-11-08 17:29:48,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:29:48,812 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 111 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:48,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 491 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:29:48,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-11-08 17:29:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 821. [2024-11-08 17:29:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 688 states have (on average 1.3968023255813953) internal successors, (961), 688 states have internal predecessors, (961), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-08 17:29:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1213 transitions. [2024-11-08 17:29:48,911 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1213 transitions. Word has length 155 [2024-11-08 17:29:48,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:48,912 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1213 transitions. [2024-11-08 17:29:48,912 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1213 transitions. [2024-11-08 17:29:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:48,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:48,916 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:48,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:29:48,917 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:48,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:48,917 INFO L85 PathProgramCache]: Analyzing trace with hash -672798461, now seen corresponding path program 1 times [2024-11-08 17:29:48,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:48,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968929809] [2024-11-08 17:29:48,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:48,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:29:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:29:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:29:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:29:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:29:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:29:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:29:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:29:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:29:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:29:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:29:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:29:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:29:49,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:49,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968929809] [2024-11-08 17:29:49,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968929809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:49,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:49,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:29:49,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394494102] [2024-11-08 17:29:49,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:49,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:29:49,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:49,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:29:49,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:29:49,128 INFO L87 Difference]: Start difference. First operand 821 states and 1213 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:49,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:49,532 INFO L93 Difference]: Finished difference Result 2300 states and 3415 transitions. [2024-11-08 17:29:49,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:29:49,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 156 [2024-11-08 17:29:49,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:49,541 INFO L225 Difference]: With dead ends: 2300 [2024-11-08 17:29:49,542 INFO L226 Difference]: Without dead ends: 1482 [2024-11-08 17:29:49,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-11-08 17:29:49,545 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 119 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:49,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 298 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:29:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2024-11-08 17:29:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1129. [2024-11-08 17:29:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 996 states have (on average 1.394578313253012) internal successors, (1389), 996 states have internal predecessors, (1389), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-08 17:29:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1641 transitions. [2024-11-08 17:29:49,698 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1641 transitions. Word has length 156 [2024-11-08 17:29:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:49,699 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1641 transitions. [2024-11-08 17:29:49,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1641 transitions. [2024-11-08 17:29:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:49,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:49,704 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:49,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:29:49,705 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:49,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash -880431361, now seen corresponding path program 1 times [2024-11-08 17:29:49,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:49,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174229321] [2024-11-08 17:29:49,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:49,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:29:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:29:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:29:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:29:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:29:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:29:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:29:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:29:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:29:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:29:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:29:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:29:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:29:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:29:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:29:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:29:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:29:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:29:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:29:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:29:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:29:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:29:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:29:54,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:29:54,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174229321] [2024-11-08 17:29:54,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174229321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:29:54,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:29:54,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 17:29:54,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327979413] [2024-11-08 17:29:54,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:29:54,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:29:54,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:29:54,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:29:54,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:29:54,966 INFO L87 Difference]: Start difference. First operand 1129 states and 1641 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:29:59,502 INFO L93 Difference]: Finished difference Result 2463 states and 3549 transitions. [2024-11-08 17:29:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 17:29:59,503 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 156 [2024-11-08 17:29:59,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:29:59,511 INFO L225 Difference]: With dead ends: 2463 [2024-11-08 17:29:59,512 INFO L226 Difference]: Without dead ends: 1694 [2024-11-08 17:29:59,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=327, Invalid=665, Unknown=0, NotChecked=0, Total=992 [2024-11-08 17:29:59,515 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1241 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:29:59,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 756 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 17:29:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2024-11-08 17:29:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1196. [2024-11-08 17:29:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1063 states have (on average 1.3969896519285043) internal successors, (1485), 1063 states have internal predecessors, (1485), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-08 17:29:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1737 transitions. [2024-11-08 17:29:59,621 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1737 transitions. Word has length 156 [2024-11-08 17:29:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:29:59,622 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1737 transitions. [2024-11-08 17:29:59,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:29:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1737 transitions. [2024-11-08 17:29:59,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 17:29:59,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:29:59,626 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:29:59,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:29:59,627 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:29:59,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:29:59,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1420391229, now seen corresponding path program 1 times [2024-11-08 17:29:59,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:29:59,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120077692] [2024-11-08 17:29:59,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:29:59,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:29:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:30:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:30:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:30:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:30:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:30:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:30:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:30:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:30:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:30:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:30:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:30:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:30:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:30:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:30:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:30:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:30:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:30:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:30:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:30:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:30:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:30:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:30:02,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:02,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120077692] [2024-11-08 17:30:02,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120077692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:02,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:02,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 17:30:02,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066027038] [2024-11-08 17:30:02,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:02,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:30:02,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:02,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:30:02,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:30:02,869 INFO L87 Difference]: Start difference. First operand 1196 states and 1737 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:30:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:06,592 INFO L93 Difference]: Finished difference Result 3459 states and 5015 transitions. [2024-11-08 17:30:06,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:30:06,593 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 156 [2024-11-08 17:30:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:06,607 INFO L225 Difference]: With dead ends: 3459 [2024-11-08 17:30:06,607 INFO L226 Difference]: Without dead ends: 2623 [2024-11-08 17:30:06,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2024-11-08 17:30:06,611 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 878 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:06,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 1008 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 17:30:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2024-11-08 17:30:06,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2516. [2024-11-08 17:30:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2516 states, 2251 states have (on average 1.3918258551754776) internal successors, (3133), 2251 states have internal predecessors, (3133), 252 states have call successors, (252), 12 states have call predecessors, (252), 12 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2024-11-08 17:30:06,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 3637 transitions. [2024-11-08 17:30:06,867 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 3637 transitions. Word has length 156 [2024-11-08 17:30:06,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:06,868 INFO L471 AbstractCegarLoop]: Abstraction has 2516 states and 3637 transitions. [2024-11-08 17:30:06,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:30:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 3637 transitions. [2024-11-08 17:30:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 17:30:06,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:06,875 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:06,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:30:06,876 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:06,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:06,876 INFO L85 PathProgramCache]: Analyzing trace with hash 746028814, now seen corresponding path program 1 times [2024-11-08 17:30:06,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:06,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722562903] [2024-11-08 17:30:06,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:06,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:30:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:30:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:30:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:30:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:30:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:30:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:30:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:30:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:30:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:30:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:30:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:30:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:30:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:30:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:30:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:30:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:30:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:30:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:30:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:30:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:30:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:30:07,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:07,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722562903] [2024-11-08 17:30:07,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722562903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:07,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:07,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:30:07,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306097598] [2024-11-08 17:30:07,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:07,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:30:07,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:07,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:30:07,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:30:07,204 INFO L87 Difference]: Start difference. First operand 2516 states and 3637 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:30:07,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:07,901 INFO L93 Difference]: Finished difference Result 6468 states and 9385 transitions. [2024-11-08 17:30:07,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:30:07,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 157 [2024-11-08 17:30:07,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:07,927 INFO L225 Difference]: With dead ends: 6468 [2024-11-08 17:30:07,928 INFO L226 Difference]: Without dead ends: 3955 [2024-11-08 17:30:07,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:30:07,936 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 114 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:07,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 529 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:30:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2024-11-08 17:30:08,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3037. [2024-11-08 17:30:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3037 states, 2772 states have (on average 1.4090909090909092) internal successors, (3906), 2772 states have internal predecessors, (3906), 252 states have call successors, (252), 12 states have call predecessors, (252), 12 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2024-11-08 17:30:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 4410 transitions. [2024-11-08 17:30:08,253 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 4410 transitions. Word has length 157 [2024-11-08 17:30:08,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:08,254 INFO L471 AbstractCegarLoop]: Abstraction has 3037 states and 4410 transitions. [2024-11-08 17:30:08,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:30:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 4410 transitions. [2024-11-08 17:30:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 17:30:08,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:08,259 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:08,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:30:08,259 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:08,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:08,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1731658046, now seen corresponding path program 1 times [2024-11-08 17:30:08,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:08,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200056533] [2024-11-08 17:30:08,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:08,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:30:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:30:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:30:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:30:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:30:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:30:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:30:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:30:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:30:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:30:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:30:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:30:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:30:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:30:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:30:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:30:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:30:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:30:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:30:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:30:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:30:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:30:11,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200056533] [2024-11-08 17:30:11,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200056533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:11,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:11,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 17:30:11,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007787643] [2024-11-08 17:30:11,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:11,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:30:11,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:11,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:30:11,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:30:11,890 INFO L87 Difference]: Start difference. First operand 3037 states and 4410 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:30:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:13,681 INFO L93 Difference]: Finished difference Result 4017 states and 5826 transitions. [2024-11-08 17:30:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:30:13,682 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 157 [2024-11-08 17:30:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:13,699 INFO L225 Difference]: With dead ends: 4017 [2024-11-08 17:30:13,699 INFO L226 Difference]: Without dead ends: 3380 [2024-11-08 17:30:13,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:30:13,703 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 431 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:13,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 608 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 17:30:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2024-11-08 17:30:13,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 3171. [2024-11-08 17:30:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3171 states, 2906 states have (on average 1.411906400550585) internal successors, (4103), 2906 states have internal predecessors, (4103), 252 states have call successors, (252), 12 states have call predecessors, (252), 12 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2024-11-08 17:30:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 4607 transitions. [2024-11-08 17:30:13,950 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 4607 transitions. Word has length 157 [2024-11-08 17:30:13,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:13,952 INFO L471 AbstractCegarLoop]: Abstraction has 3171 states and 4607 transitions. [2024-11-08 17:30:13,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:30:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 4607 transitions. [2024-11-08 17:30:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 17:30:13,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:13,957 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:13,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:30:13,958 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:13,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:13,959 INFO L85 PathProgramCache]: Analyzing trace with hash 874365508, now seen corresponding path program 1 times [2024-11-08 17:30:13,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:13,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229163523] [2024-11-08 17:30:13,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:13,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:30:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:30:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:30:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:30:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:30:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:30:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:30:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:30:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:30:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:30:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:30:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:30:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:30:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:30:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:30:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:30:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:30:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:30:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:30:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:30:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:30:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:15,823 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:30:15,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:15,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229163523] [2024-11-08 17:30:15,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229163523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:15,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:15,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:30:15,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929683326] [2024-11-08 17:30:15,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:15,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:30:15,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:15,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:30:15,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:30:15,827 INFO L87 Difference]: Start difference. First operand 3171 states and 4607 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:30:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:17,196 INFO L93 Difference]: Finished difference Result 4887 states and 7102 transitions. [2024-11-08 17:30:17,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:30:17,197 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 157 [2024-11-08 17:30:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:17,215 INFO L225 Difference]: With dead ends: 4887 [2024-11-08 17:30:17,215 INFO L226 Difference]: Without dead ends: 3328 [2024-11-08 17:30:17,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:30:17,220 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 302 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:17,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 681 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:30:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2024-11-08 17:30:17,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 3140. [2024-11-08 17:30:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3140 states, 2875 states have (on average 1.4114782608695653) internal successors, (4058), 2875 states have internal predecessors, (4058), 252 states have call successors, (252), 12 states have call predecessors, (252), 12 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2024-11-08 17:30:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4562 transitions. [2024-11-08 17:30:17,503 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4562 transitions. Word has length 157 [2024-11-08 17:30:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:17,503 INFO L471 AbstractCegarLoop]: Abstraction has 3140 states and 4562 transitions. [2024-11-08 17:30:17,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:30:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4562 transitions. [2024-11-08 17:30:17,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 17:30:17,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:17,507 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:17,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:30:17,508 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:17,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:17,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1539544917, now seen corresponding path program 1 times [2024-11-08 17:30:17,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:17,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159745556] [2024-11-08 17:30:17,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:17,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:17,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:30:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:17,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:30:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:17,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:30:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:17,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:30:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:17,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:30:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:17,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:30:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:17,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:30:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:17,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:30:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:17,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:30:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:17,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:30:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:17,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:30:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:17,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:30:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:17,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:30:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:17,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:30:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:18,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:30:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:18,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:30:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:18,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:30:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:18,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:30:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:30:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:18,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:30:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:18,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:30:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:30:18,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:18,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159745556] [2024-11-08 17:30:18,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159745556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:18,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:18,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:30:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899577122] [2024-11-08 17:30:18,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:18,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:30:18,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:18,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:30:18,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:30:18,024 INFO L87 Difference]: Start difference. First operand 3140 states and 4562 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:30:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:18,614 INFO L93 Difference]: Finished difference Result 8446 states and 12263 transitions. [2024-11-08 17:30:18,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:30:18,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 157 [2024-11-08 17:30:18,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:18,645 INFO L225 Difference]: With dead ends: 8446 [2024-11-08 17:30:18,646 INFO L226 Difference]: Without dead ends: 6161 [2024-11-08 17:30:18,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:30:18,654 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 446 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:18,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 543 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:30:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6161 states. [2024-11-08 17:30:19,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6161 to 6145. [2024-11-08 17:30:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6145 states, 5640 states have (on average 1.4099290780141844) internal successors, (7952), 5652 states have internal predecessors, (7952), 480 states have call successors, (480), 24 states have call predecessors, (480), 24 states have return successors, (480), 468 states have call predecessors, (480), 480 states have call successors, (480) [2024-11-08 17:30:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6145 states to 6145 states and 8912 transitions. [2024-11-08 17:30:19,135 INFO L78 Accepts]: Start accepts. Automaton has 6145 states and 8912 transitions. Word has length 157 [2024-11-08 17:30:19,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:19,136 INFO L471 AbstractCegarLoop]: Abstraction has 6145 states and 8912 transitions. [2024-11-08 17:30:19,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:30:19,136 INFO L276 IsEmpty]: Start isEmpty. Operand 6145 states and 8912 transitions. [2024-11-08 17:30:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 17:30:19,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:19,142 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:19,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 17:30:19,143 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:19,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:19,143 INFO L85 PathProgramCache]: Analyzing trace with hash -39183623, now seen corresponding path program 1 times [2024-11-08 17:30:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:19,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357722933] [2024-11-08 17:30:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:30:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:30:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:30:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:30:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:30:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:30:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:30:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:30:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:30:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:30:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:30:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:30:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:30:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:30:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:30:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:30:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:30:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:30:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:30:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:30:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:30:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:30:25,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:25,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357722933] [2024-11-08 17:30:25,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357722933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:25,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:25,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 17:30:25,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036268958] [2024-11-08 17:30:25,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:25,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:30:25,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:25,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:30:25,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:30:25,435 INFO L87 Difference]: Start difference. First operand 6145 states and 8912 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:30:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:28,378 INFO L93 Difference]: Finished difference Result 11807 states and 17032 transitions. [2024-11-08 17:30:28,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:30:28,379 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 157 [2024-11-08 17:30:28,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:28,400 INFO L225 Difference]: With dead ends: 11807 [2024-11-08 17:30:28,400 INFO L226 Difference]: Without dead ends: 7807 [2024-11-08 17:30:28,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:30:28,407 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 404 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:28,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 614 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 17:30:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7807 states. [2024-11-08 17:30:28,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7807 to 6929. [2024-11-08 17:30:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6929 states, 6424 states have (on average 1.4084682440846825) internal successors, (9048), 6436 states have internal predecessors, (9048), 480 states have call successors, (480), 24 states have call predecessors, (480), 24 states have return successors, (480), 468 states have call predecessors, (480), 480 states have call successors, (480) [2024-11-08 17:30:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6929 states to 6929 states and 10008 transitions. [2024-11-08 17:30:28,857 INFO L78 Accepts]: Start accepts. Automaton has 6929 states and 10008 transitions. Word has length 157 [2024-11-08 17:30:28,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:28,858 INFO L471 AbstractCegarLoop]: Abstraction has 6929 states and 10008 transitions. [2024-11-08 17:30:28,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:30:28,858 INFO L276 IsEmpty]: Start isEmpty. Operand 6929 states and 10008 transitions. [2024-11-08 17:30:28,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:30:28,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:28,863 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:28,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:30:28,864 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:28,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:28,865 INFO L85 PathProgramCache]: Analyzing trace with hash 635901236, now seen corresponding path program 1 times [2024-11-08 17:30:28,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:28,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034518378] [2024-11-08 17:30:28,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:28,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:30:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:30:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:30:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:30:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:30:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:30:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:30:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:30:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:30:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:30:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:30:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:30:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:30:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:30:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:30:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:30:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:30:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:30:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:30:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:30:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:30:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:30:29,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:29,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034518378] [2024-11-08 17:30:29,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034518378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:29,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:29,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:30:29,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843370040] [2024-11-08 17:30:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:29,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:30:29,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:29,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:30:29,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:30:29,132 INFO L87 Difference]: Start difference. First operand 6929 states and 10008 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:30:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:30:30,007 INFO L93 Difference]: Finished difference Result 16087 states and 23341 transitions. [2024-11-08 17:30:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:30:30,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 158 [2024-11-08 17:30:30,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:30:30,039 INFO L225 Difference]: With dead ends: 16087 [2024-11-08 17:30:30,039 INFO L226 Difference]: Without dead ends: 9157 [2024-11-08 17:30:30,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:30:30,049 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 305 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:30:30,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 523 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:30:30,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9157 states. [2024-11-08 17:30:30,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9157 to 6393. [2024-11-08 17:30:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6393 states, 5888 states have (on average 1.3794157608695652) internal successors, (8122), 5900 states have internal predecessors, (8122), 480 states have call successors, (480), 24 states have call predecessors, (480), 24 states have return successors, (480), 468 states have call predecessors, (480), 480 states have call successors, (480) [2024-11-08 17:30:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6393 states to 6393 states and 9082 transitions. [2024-11-08 17:30:30,489 INFO L78 Accepts]: Start accepts. Automaton has 6393 states and 9082 transitions. Word has length 158 [2024-11-08 17:30:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:30:30,490 INFO L471 AbstractCegarLoop]: Abstraction has 6393 states and 9082 transitions. [2024-11-08 17:30:30,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:30:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand 6393 states and 9082 transitions. [2024-11-08 17:30:30,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:30:30,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:30:30,496 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:30:30,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 17:30:30,496 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:30:30,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:30:30,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1771917814, now seen corresponding path program 1 times [2024-11-08 17:30:30,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:30:30,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190007393] [2024-11-08 17:30:30,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:30:30,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:30:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:58,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:30:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:58,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:30:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:58,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:30:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:58,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:30:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:58,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:30:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:58,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:30:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:58,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:30:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:58,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:30:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:30:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:30:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:30:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:30:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:30:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:30:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:30:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:30:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:30:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:30:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:30:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:30:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:30:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:30:59,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:30:59,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190007393] [2024-11-08 17:30:59,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190007393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:30:59,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:30:59,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:30:59,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657275399] [2024-11-08 17:30:59,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:30:59,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:30:59,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:30:59,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:30:59,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:30:59,043 INFO L87 Difference]: Start difference. First operand 6393 states and 9082 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:02,549 INFO L93 Difference]: Finished difference Result 8222 states and 11529 transitions. [2024-11-08 17:31:02,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:31:02,550 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 158 [2024-11-08 17:31:02,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:02,592 INFO L225 Difference]: With dead ends: 8222 [2024-11-08 17:31:02,596 INFO L226 Difference]: Without dead ends: 8220 [2024-11-08 17:31:02,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2024-11-08 17:31:02,604 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 480 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:02,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1262 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 17:31:02,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8220 states. [2024-11-08 17:31:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8220 to 7435. [2024-11-08 17:31:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7435 states, 6918 states have (on average 1.3713501011853138) internal successors, (9487), 6934 states have internal predecessors, (9487), 488 states have call successors, (488), 28 states have call predecessors, (488), 28 states have return successors, (488), 472 states have call predecessors, (488), 488 states have call successors, (488) [2024-11-08 17:31:03,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 10463 transitions. [2024-11-08 17:31:03,099 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 10463 transitions. Word has length 158 [2024-11-08 17:31:03,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:03,100 INFO L471 AbstractCegarLoop]: Abstraction has 7435 states and 10463 transitions. [2024-11-08 17:31:03,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 10463 transitions. [2024-11-08 17:31:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:31:03,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:03,106 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:31:03,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 17:31:03,107 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:31:03,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash 518925434, now seen corresponding path program 1 times [2024-11-08 17:31:03,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:03,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642540852] [2024-11-08 17:31:03,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:31:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:31:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:31:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:31:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:31:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:31:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:31:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:31:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:31:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:31:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:31:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:31:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:31:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:31:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:31:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:31:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:31:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:31:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:31:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:31:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:31:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:31:03,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:03,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642540852] [2024-11-08 17:31:03,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642540852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:31:03,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:31:03,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:31:03,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48722571] [2024-11-08 17:31:03,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:31:03,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:31:03,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:03,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:31:03,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:31:03,327 INFO L87 Difference]: Start difference. First operand 7435 states and 10463 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:04,114 INFO L93 Difference]: Finished difference Result 16077 states and 22686 transitions. [2024-11-08 17:31:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:31:04,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 158 [2024-11-08 17:31:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:04,142 INFO L225 Difference]: With dead ends: 16077 [2024-11-08 17:31:04,142 INFO L226 Difference]: Without dead ends: 8613 [2024-11-08 17:31:04,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:31:04,155 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 123 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:04,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 506 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:31:04,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8613 states. [2024-11-08 17:31:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8613 to 7029. [2024-11-08 17:31:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7029 states, 6512 states have (on average 1.3538083538083538) internal successors, (8816), 6528 states have internal predecessors, (8816), 488 states have call successors, (488), 28 states have call predecessors, (488), 28 states have return successors, (488), 472 states have call predecessors, (488), 488 states have call successors, (488) [2024-11-08 17:31:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7029 states to 7029 states and 9792 transitions. [2024-11-08 17:31:04,728 INFO L78 Accepts]: Start accepts. Automaton has 7029 states and 9792 transitions. Word has length 158 [2024-11-08 17:31:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:04,728 INFO L471 AbstractCegarLoop]: Abstraction has 7029 states and 9792 transitions. [2024-11-08 17:31:04,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 7029 states and 9792 transitions. [2024-11-08 17:31:04,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:31:04,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:04,733 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:31:04,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 17:31:04,734 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:31:04,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:04,734 INFO L85 PathProgramCache]: Analyzing trace with hash 989963808, now seen corresponding path program 1 times [2024-11-08 17:31:04,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:04,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446910965] [2024-11-08 17:31:04,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:04,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:31:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:31:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:31:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:31:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:31:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:31:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:31:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:31:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:31:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:31:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:31:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:31:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:31:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:31:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:31:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:31:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:31:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:31:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:31:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:31:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:31:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:31:06,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:06,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446910965] [2024-11-08 17:31:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446910965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:31:06,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:31:06,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:31:06,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677781706] [2024-11-08 17:31:06,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:31:06,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:31:06,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:06,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:31:06,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:31:06,948 INFO L87 Difference]: Start difference. First operand 7029 states and 9792 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:10,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:10,790 INFO L93 Difference]: Finished difference Result 14120 states and 19351 transitions. [2024-11-08 17:31:10,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:31:10,791 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 158 [2024-11-08 17:31:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:10,816 INFO L225 Difference]: With dead ends: 14120 [2024-11-08 17:31:10,816 INFO L226 Difference]: Without dead ends: 9008 [2024-11-08 17:31:10,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2024-11-08 17:31:10,826 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 630 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:10,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 1052 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1747 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 17:31:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9008 states. [2024-11-08 17:31:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9008 to 6917. [2024-11-08 17:31:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6917 states, 6400 states have (on average 1.35296875) internal successors, (8659), 6416 states have internal predecessors, (8659), 488 states have call successors, (488), 28 states have call predecessors, (488), 28 states have return successors, (488), 472 states have call predecessors, (488), 488 states have call successors, (488) [2024-11-08 17:31:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6917 states to 6917 states and 9635 transitions. [2024-11-08 17:31:11,540 INFO L78 Accepts]: Start accepts. Automaton has 6917 states and 9635 transitions. Word has length 158 [2024-11-08 17:31:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:11,540 INFO L471 AbstractCegarLoop]: Abstraction has 6917 states and 9635 transitions. [2024-11-08 17:31:11,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 6917 states and 9635 transitions. [2024-11-08 17:31:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 17:31:11,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:11,546 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:31:11,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 17:31:11,547 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:31:11,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:11,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1419729093, now seen corresponding path program 1 times [2024-11-08 17:31:11,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:11,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598206474] [2024-11-08 17:31:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:11,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:31:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:31:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:31:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:31:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:31:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:31:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:31:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:31:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:31:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:31:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:31:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:31:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:31:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:31:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:31:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:31:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:31:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:31:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:31:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:31:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:31:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:31:14,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:14,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598206474] [2024-11-08 17:31:14,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598206474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:31:14,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:31:14,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 17:31:14,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017401227] [2024-11-08 17:31:14,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:31:14,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:31:14,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:14,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:31:14,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:31:14,345 INFO L87 Difference]: Start difference. First operand 6917 states and 9635 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:16,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:16,133 INFO L93 Difference]: Finished difference Result 10746 states and 14874 transitions. [2024-11-08 17:31:16,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:31:16,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 158 [2024-11-08 17:31:16,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:16,162 INFO L225 Difference]: With dead ends: 10746 [2024-11-08 17:31:16,162 INFO L226 Difference]: Without dead ends: 8265 [2024-11-08 17:31:16,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:31:16,170 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 481 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:16,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 593 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 17:31:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8265 states. [2024-11-08 17:31:16,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8265 to 7025. [2024-11-08 17:31:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7025 states, 6508 states have (on average 1.351720958819914) internal successors, (8797), 6524 states have internal predecessors, (8797), 488 states have call successors, (488), 28 states have call predecessors, (488), 28 states have return successors, (488), 472 states have call predecessors, (488), 488 states have call successors, (488) [2024-11-08 17:31:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 9773 transitions. [2024-11-08 17:31:16,778 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 9773 transitions. Word has length 158 [2024-11-08 17:31:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:16,779 INFO L471 AbstractCegarLoop]: Abstraction has 7025 states and 9773 transitions. [2024-11-08 17:31:16,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:16,780 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 9773 transitions. [2024-11-08 17:31:16,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 17:31:16,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:16,786 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:31:16,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 17:31:16,786 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:31:16,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:16,787 INFO L85 PathProgramCache]: Analyzing trace with hash -730710882, now seen corresponding path program 1 times [2024-11-08 17:31:16,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:16,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844441168] [2024-11-08 17:31:16,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:16,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:31:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:31:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:31:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:31:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:31:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:31:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:31:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:31:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:31:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:31:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:31:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:31:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:31:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:31:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:31:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:31:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:31:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:31:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:31:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:31:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:31:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-08 17:31:17,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:17,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844441168] [2024-11-08 17:31:17,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844441168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:31:17,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:31:17,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:31:17,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812629232] [2024-11-08 17:31:17,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:31:17,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:31:17,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:17,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:31:17,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:31:17,287 INFO L87 Difference]: Start difference. First operand 7025 states and 9773 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:17,842 INFO L93 Difference]: Finished difference Result 7073 states and 9815 transitions. [2024-11-08 17:31:17,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:31:17,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-11-08 17:31:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:17,854 INFO L225 Difference]: With dead ends: 7073 [2024-11-08 17:31:17,854 INFO L226 Difference]: Without dead ends: 1965 [2024-11-08 17:31:17,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:31:17,864 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 248 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:17,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 414 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:31:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2024-11-08 17:31:17,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 498. [2024-11-08 17:31:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 451 states have (on average 1.334811529933481) internal successors, (602), 451 states have internal predecessors, (602), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 17:31:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 686 transitions. [2024-11-08 17:31:17,951 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 686 transitions. Word has length 159 [2024-11-08 17:31:17,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:17,952 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 686 transitions. [2024-11-08 17:31:17,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 686 transitions. [2024-11-08 17:31:17,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 17:31:17,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:17,955 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:31:17,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 17:31:17,955 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:31:17,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:17,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1221759476, now seen corresponding path program 1 times [2024-11-08 17:31:17,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:17,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433207741] [2024-11-08 17:31:17,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:17,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:31:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:31:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:31:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:31:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:31:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:31:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:31:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:31:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:31:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:31:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:31:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:31:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:31:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:31:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:31:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:31:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:31:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:31:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:31:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:31:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:31:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:31:18,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:18,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433207741] [2024-11-08 17:31:18,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433207741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:31:18,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:31:18,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:31:18,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619779502] [2024-11-08 17:31:18,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:31:18,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:31:18,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:18,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:31:18,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:31:18,483 INFO L87 Difference]: Start difference. First operand 498 states and 686 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:18,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:18,964 INFO L93 Difference]: Finished difference Result 1069 states and 1477 transitions. [2024-11-08 17:31:18,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:31:18,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-11-08 17:31:18,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:18,969 INFO L225 Difference]: With dead ends: 1069 [2024-11-08 17:31:18,969 INFO L226 Difference]: Without dead ends: 574 [2024-11-08 17:31:18,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:31:18,971 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 160 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:18,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 223 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:31:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-08 17:31:19,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 498. [2024-11-08 17:31:19,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 451 states have (on average 1.328159645232816) internal successors, (599), 451 states have internal predecessors, (599), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 17:31:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 683 transitions. [2024-11-08 17:31:19,039 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 683 transitions. Word has length 159 [2024-11-08 17:31:19,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:19,040 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 683 transitions. [2024-11-08 17:31:19,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:19,040 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 683 transitions. [2024-11-08 17:31:19,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 17:31:19,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:19,042 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:31:19,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 17:31:19,043 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:31:19,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1362308086, now seen corresponding path program 1 times [2024-11-08 17:31:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:19,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837020441] [2024-11-08 17:31:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:19,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:31:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:31:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:31:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:31:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:31:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:31:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:31:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:31:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:31:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:31:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:31:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:31:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:31:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:31:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:31:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:31:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:31:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:31:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:31:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:31:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:31:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:31:34,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:34,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837020441] [2024-11-08 17:31:34,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837020441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:31:34,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:31:34,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:31:34,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903577719] [2024-11-08 17:31:34,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:31:34,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:31:34,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:34,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:31:34,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:31:34,454 INFO L87 Difference]: Start difference. First operand 498 states and 683 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:38,386 INFO L93 Difference]: Finished difference Result 1032 states and 1404 transitions. [2024-11-08 17:31:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:31:38,388 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-11-08 17:31:38,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:38,393 INFO L225 Difference]: With dead ends: 1032 [2024-11-08 17:31:38,393 INFO L226 Difference]: Without dead ends: 705 [2024-11-08 17:31:38,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:31:38,395 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 457 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:38,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 547 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 17:31:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-08 17:31:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 560. [2024-11-08 17:31:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 511 states have (on average 1.3228962818003913) internal successors, (676), 511 states have internal predecessors, (676), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 17:31:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 760 transitions. [2024-11-08 17:31:38,482 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 760 transitions. Word has length 159 [2024-11-08 17:31:38,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:38,482 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 760 transitions. [2024-11-08 17:31:38,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 760 transitions. [2024-11-08 17:31:38,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 17:31:38,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:38,485 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:31:38,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 17:31:38,486 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:31:38,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:38,487 INFO L85 PathProgramCache]: Analyzing trace with hash 544659636, now seen corresponding path program 1 times [2024-11-08 17:31:38,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:38,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085433524] [2024-11-08 17:31:38,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:38,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:31:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:31:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:31:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:31:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:31:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:31:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:31:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:31:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:31:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:31:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:31:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:31:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:31:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:31:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:31:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:31:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:31:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:31:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:31:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:31:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:31:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:31:38,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:38,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085433524] [2024-11-08 17:31:38,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085433524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:31:38,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:31:38,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:31:38,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575712817] [2024-11-08 17:31:38,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:31:38,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:31:38,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:38,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:31:38,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:31:38,857 INFO L87 Difference]: Start difference. First operand 560 states and 760 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:39,293 INFO L93 Difference]: Finished difference Result 1757 states and 2390 transitions. [2024-11-08 17:31:39,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:31:39,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-11-08 17:31:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:39,301 INFO L225 Difference]: With dead ends: 1757 [2024-11-08 17:31:39,301 INFO L226 Difference]: Without dead ends: 1200 [2024-11-08 17:31:39,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:31:39,304 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 206 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:39,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 478 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:31:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2024-11-08 17:31:39,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1084. [2024-11-08 17:31:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 987 states have (on average 1.32016210739615) internal successors, (1303), 987 states have internal predecessors, (1303), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-08 17:31:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1471 transitions. [2024-11-08 17:31:39,462 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1471 transitions. Word has length 159 [2024-11-08 17:31:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:39,463 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1471 transitions. [2024-11-08 17:31:39,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1471 transitions. [2024-11-08 17:31:39,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 17:31:39,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:39,466 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:31:39,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 17:31:39,466 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:31:39,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:39,467 INFO L85 PathProgramCache]: Analyzing trace with hash -301970656, now seen corresponding path program 1 times [2024-11-08 17:31:39,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:39,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499711078] [2024-11-08 17:31:39,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:39,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:31:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:31:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:31:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:31:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:31:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:31:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:31:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:31:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:31:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:31:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:31:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:31:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:31:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:31:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:31:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:31:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:31:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:31:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:31:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:31:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:31:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:31:45,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:45,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499711078] [2024-11-08 17:31:45,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499711078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:31:45,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:31:45,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 17:31:45,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376702349] [2024-11-08 17:31:45,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:31:45,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:31:45,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:45,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:31:45,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:31:45,224 INFO L87 Difference]: Start difference. First operand 1084 states and 1471 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:47,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:47,406 INFO L93 Difference]: Finished difference Result 2610 states and 3534 transitions. [2024-11-08 17:31:47,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:31:47,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-11-08 17:31:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:47,413 INFO L225 Difference]: With dead ends: 2610 [2024-11-08 17:31:47,413 INFO L226 Difference]: Without dead ends: 1529 [2024-11-08 17:31:47,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:31:47,417 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 170 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:47,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 515 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 17:31:47,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2024-11-08 17:31:47,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1524. [2024-11-08 17:31:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1417 states have (on average 1.3140437544107268) internal successors, (1862), 1420 states have internal predecessors, (1862), 90 states have call successors, (90), 16 states have call predecessors, (90), 16 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 17:31:47,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2042 transitions. [2024-11-08 17:31:47,671 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 2042 transitions. Word has length 159 [2024-11-08 17:31:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:47,672 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 2042 transitions. [2024-11-08 17:31:47,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 2042 transitions. [2024-11-08 17:31:47,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 17:31:47,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:47,676 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:31:47,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 17:31:47,677 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:31:47,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:47,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1003570530, now seen corresponding path program 1 times [2024-11-08 17:31:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:47,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635562787] [2024-11-08 17:31:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:47,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:31:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:31:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:31:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:31:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:31:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:31:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:31:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:31:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:31:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:31:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:31:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:31:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:31:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:31:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:31:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:31:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:31:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:31:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:31:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:31:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:31:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:31:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:31:53,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:31:53,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635562787] [2024-11-08 17:31:53,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635562787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:31:53,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:31:53,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 17:31:53,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762653341] [2024-11-08 17:31:53,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:31:53,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:31:53,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:31:53,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:31:53,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:31:53,654 INFO L87 Difference]: Start difference. First operand 1524 states and 2042 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:55,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:31:55,396 INFO L93 Difference]: Finished difference Result 2819 states and 3786 transitions. [2024-11-08 17:31:55,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:31:55,397 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-11-08 17:31:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:31:55,402 INFO L225 Difference]: With dead ends: 2819 [2024-11-08 17:31:55,403 INFO L226 Difference]: Without dead ends: 1662 [2024-11-08 17:31:55,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:31:55,406 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 193 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:31:55,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 410 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 17:31:55,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2024-11-08 17:31:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1564. [2024-11-08 17:31:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1457 states have (on average 1.3067947838023335) internal successors, (1904), 1460 states have internal predecessors, (1904), 90 states have call successors, (90), 16 states have call predecessors, (90), 16 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 17:31:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2084 transitions. [2024-11-08 17:31:55,606 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2084 transitions. Word has length 159 [2024-11-08 17:31:55,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:31:55,607 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2084 transitions. [2024-11-08 17:31:55,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:31:55,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2084 transitions. [2024-11-08 17:31:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:31:55,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:31:55,611 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:31:55,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 17:31:55,611 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:31:55,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:31:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1590528067, now seen corresponding path program 1 times [2024-11-08 17:31:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:31:55,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609268472] [2024-11-08 17:31:55,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:31:55,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:31:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:32:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:32:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:32:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:32:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:32:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:32:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:32:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:32:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:32:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:32:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:32:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:32:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:32:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:32:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:32:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:32:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:32:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:32:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:32:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:32:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:32:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:32:06,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:32:06,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609268472] [2024-11-08 17:32:06,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609268472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:32:06,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:32:06,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 17:32:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328907671] [2024-11-08 17:32:06,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:32:06,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:32:06,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:32:06,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:32:06,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:32:06,960 INFO L87 Difference]: Start difference. First operand 1564 states and 2084 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:32:09,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:32:09,490 INFO L93 Difference]: Finished difference Result 2885 states and 3845 transitions. [2024-11-08 17:32:09,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:32:09,492 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 160 [2024-11-08 17:32:09,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:32:09,502 INFO L225 Difference]: With dead ends: 2885 [2024-11-08 17:32:09,502 INFO L226 Difference]: Without dead ends: 1688 [2024-11-08 17:32:09,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:32:09,512 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 313 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:32:09,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 461 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 17:32:09,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2024-11-08 17:32:09,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1537. [2024-11-08 17:32:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1430 states have (on average 1.3062937062937063) internal successors, (1868), 1433 states have internal predecessors, (1868), 90 states have call successors, (90), 16 states have call predecessors, (90), 16 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 17:32:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2048 transitions. [2024-11-08 17:32:09,703 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2048 transitions. Word has length 160 [2024-11-08 17:32:09,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:32:09,704 INFO L471 AbstractCegarLoop]: Abstraction has 1537 states and 2048 transitions. [2024-11-08 17:32:09,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:32:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2048 transitions. [2024-11-08 17:32:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:32:09,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:32:09,706 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:32:09,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 17:32:09,707 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:32:09,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:32:09,707 INFO L85 PathProgramCache]: Analyzing trace with hash -965995933, now seen corresponding path program 1 times [2024-11-08 17:32:09,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:32:09,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768646151] [2024-11-08 17:32:09,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:32:09,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:32:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:32:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:32:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:32:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:32:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:32:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:32:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:32:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:32:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:32:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:32:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:32:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:32:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:32:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:32:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:32:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:32:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:32:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:32:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:32:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:32:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:32:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 108 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-11-08 17:32:10,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:32:10,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768646151] [2024-11-08 17:32:10,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768646151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:32:10,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581842243] [2024-11-08 17:32:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:32:10,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:32:10,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:32:10,356 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:32:10,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:32:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:11,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 17:32:11,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:32:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 136 proven. 159 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2024-11-08 17:32:12,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:32:15,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581842243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:32:15,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:32:15,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 17 [2024-11-08 17:32:15,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547068967] [2024-11-08 17:32:15,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:32:15,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 17:32:15,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:32:15,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 17:32:15,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2024-11-08 17:32:15,290 INFO L87 Difference]: Start difference. First operand 1537 states and 2048 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 5 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) [2024-11-08 17:32:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:32:16,858 INFO L93 Difference]: Finished difference Result 3041 states and 3998 transitions. [2024-11-08 17:32:16,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 17:32:16,859 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 5 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) Word has length 160 [2024-11-08 17:32:16,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:32:16,865 INFO L225 Difference]: With dead ends: 3041 [2024-11-08 17:32:16,865 INFO L226 Difference]: Without dead ends: 1511 [2024-11-08 17:32:16,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2024-11-08 17:32:16,870 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 505 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:32:16,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 408 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:32:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2024-11-08 17:32:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1021. [2024-11-08 17:32:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 916 states have (on average 1.2805676855895196) internal successors, (1173), 916 states have internal predecessors, (1173), 84 states have call successors, (84), 20 states have call predecessors, (84), 20 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-08 17:32:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1341 transitions. [2024-11-08 17:32:17,086 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1341 transitions. Word has length 160 [2024-11-08 17:32:17,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:32:17,087 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1341 transitions. [2024-11-08 17:32:17,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 5 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) [2024-11-08 17:32:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1341 transitions. [2024-11-08 17:32:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 17:32:17,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:32:17,090 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:32:17,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:32:17,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:32:17,295 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:32:17,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:32:17,296 INFO L85 PathProgramCache]: Analyzing trace with hash 70884572, now seen corresponding path program 1 times [2024-11-08 17:32:17,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:32:17,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830282527] [2024-11-08 17:32:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:32:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:32:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:32:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:32:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:32:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:32:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:32:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:32:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 17:32:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:32:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:32:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:32:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:32:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:32:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:32:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 17:32:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:32:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 17:32:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 17:32:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:17,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 17:32:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:18,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:32:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:18,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:32:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:18,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 17:32:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 108 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-11-08 17:32:18,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:32:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830282527] [2024-11-08 17:32:18,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830282527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:32:18,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020500184] [2024-11-08 17:32:18,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:32:18,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:32:18,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:32:18,021 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:32:18,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:32:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:18,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 17:32:18,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:32:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 136 proven. 159 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2024-11-08 17:32:19,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:32:20,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020500184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:32:20,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:32:20,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 16 [2024-11-08 17:32:20,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420036811] [2024-11-08 17:32:20,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:32:20,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:32:20,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:32:20,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:32:20,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-08 17:32:20,483 INFO L87 Difference]: Start difference. First operand 1021 states and 1341 transitions. Second operand has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 5 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) [2024-11-08 17:32:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:32:22,366 INFO L93 Difference]: Finished difference Result 2001 states and 2616 transitions. [2024-11-08 17:32:22,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 17:32:22,367 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 5 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) Word has length 162 [2024-11-08 17:32:22,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:32:22,373 INFO L225 Difference]: With dead ends: 2001 [2024-11-08 17:32:22,373 INFO L226 Difference]: Without dead ends: 983 [2024-11-08 17:32:22,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=334, Invalid=1148, Unknown=0, NotChecked=0, Total=1482 [2024-11-08 17:32:22,377 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 362 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:32:22,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 667 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:32:22,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-11-08 17:32:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 771. [2024-11-08 17:32:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 692 states have (on average 1.2875722543352601) internal successors, (891), 692 states have internal predecessors, (891), 63 states have call successors, (63), 15 states have call predecessors, (63), 15 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-08 17:32:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1017 transitions. [2024-11-08 17:32:22,532 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1017 transitions. Word has length 162 [2024-11-08 17:32:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:32:22,533 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1017 transitions. [2024-11-08 17:32:22,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 5 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) [2024-11-08 17:32:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1017 transitions. [2024-11-08 17:32:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 17:32:22,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:32:22,535 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:32:22,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 17:32:22,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-08 17:32:22,736 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:32:22,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:32:22,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1980099426, now seen corresponding path program 1 times [2024-11-08 17:32:22,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:32:22,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863354951] [2024-11-08 17:32:22,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:32:22,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:32:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:32:22,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1773970327] [2024-11-08 17:32:22,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:32:22,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:32:22,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:32:22,887 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:32:22,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:32:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:32:23,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:32:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:32:23,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:32:23,599 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:32:23,600 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:32:23,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 17:32:23,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-08 17:32:23,813 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:32:24,009 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:32:24,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:32:24 BoogieIcfgContainer [2024-11-08 17:32:24,016 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:32:24,017 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:32:24,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:32:24,018 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:32:24,019 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:32" (3/4) ... [2024-11-08 17:32:24,022 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:32:24,024 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:32:24,025 INFO L158 Benchmark]: Toolchain (without parser) took 173974.06ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 126.8MB in the beginning and 853.4MB in the end (delta: -726.6MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-08 17:32:24,025 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 159.4MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:32:24,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.87ms. Allocated memory is still 159.4MB. Free memory was 126.3MB in the beginning and 107.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 17:32:24,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.94ms. Allocated memory is still 159.4MB. Free memory was 107.5MB in the beginning and 99.5MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 17:32:24,026 INFO L158 Benchmark]: Boogie Preprocessor took 121.39ms. Allocated memory is still 159.4MB. Free memory was 99.5MB in the beginning and 89.3MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 17:32:24,026 INFO L158 Benchmark]: RCFGBuilder took 1316.92ms. Allocated memory is still 159.4MB. Free memory was 89.3MB in the beginning and 105.8MB in the end (delta: -16.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 17:32:24,026 INFO L158 Benchmark]: TraceAbstraction took 171781.84ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 105.1MB in the beginning and 854.5MB in the end (delta: -749.4MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-08 17:32:24,027 INFO L158 Benchmark]: Witness Printer took 6.76ms. Allocated memory is still 2.2GB. Free memory was 854.5MB in the beginning and 853.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:32:24,030 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.40ms. Allocated memory is still 159.4MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.87ms. Allocated memory is still 159.4MB. Free memory was 126.3MB in the beginning and 107.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.94ms. Allocated memory is still 159.4MB. Free memory was 107.5MB in the beginning and 99.5MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.39ms. Allocated memory is still 159.4MB. Free memory was 99.5MB in the beginning and 89.3MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1316.92ms. Allocated memory is still 159.4MB. Free memory was 89.3MB in the beginning and 105.8MB in the end (delta: -16.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 171781.84ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 105.1MB in the beginning and 854.5MB in the end (delta: -749.4MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 6.76ms. Allocated memory is still 2.2GB. Free memory was 854.5MB in the beginning and 853.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of shiftRight at line 167. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 50; [L23] unsigned char var_1_5 = 200; [L24] unsigned char var_1_6 = 64; [L25] signed short int var_1_7 = -2; [L26] signed long int var_1_8 = 16; [L27] unsigned char var_1_11 = 1; [L28] signed char var_1_12 = 8; [L29] signed char var_1_13 = 0; [L30] signed char var_1_14 = 10; [L31] signed char var_1_15 = 8; [L32] unsigned char var_1_16 = 5; [L33] unsigned char var_1_17 = 100; [L34] unsigned char var_1_18 = 25; [L35] unsigned char var_1_19 = 0; [L36] signed short int var_1_20 = -128; [L37] signed short int var_1_21 = -8; [L38] double var_1_22 = 100000000000.35; [L39] double var_1_23 = 199.4; [L40] double var_1_24 = 63.5; [L41] signed short int var_1_25 = 1; [L42] unsigned char var_1_27 = 1; [L43] unsigned char var_1_28 = 0; [L44] signed short int var_1_29 = -8; [L45] signed long int last_1_var_1_8 = 16; [L46] unsigned char last_1_var_1_16 = 5; VAL [isInitial=0, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=200, var_1_6=64, var_1_7=-2, var_1_8=16] [L171] isInitial = 1 [L172] FCALL initially() [L173] COND TRUE 1 [L174] CALL updateLastVariables() [L163] last_1_var_1_8 = var_1_8 [L164] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=200, var_1_6=64, var_1_7=-2, var_1_8=16] [L174] RET updateLastVariables() [L175] CALL updateVariables() [L128] var_1_5 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_5 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=64, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=64, var_1_7=-2, var_1_8=16] [L129] RET assume_abort_if_not(var_1_5 >= 190) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=64, var_1_7=-2, var_1_8=16] [L130] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=64, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=64, var_1_7=-2, var_1_8=16] [L130] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=64, var_1_7=-2, var_1_8=16] [L131] var_1_6 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_7=-2, var_1_8=16] [L132] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_7=-2, var_1_8=16] [L133] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L133] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L134] var_1_13 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L135] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L136] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L136] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L137] var_1_14 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L138] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L139] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L139] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L140] var_1_15 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_15 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L141] RET assume_abort_if_not(var_1_15 >= -63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L142] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L142] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L143] var_1_17 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_17 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L144] RET assume_abort_if_not(var_1_17 >= 95) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L145] CALL assume_abort_if_not(var_1_17 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L145] RET assume_abort_if_not(var_1_17 <= 127) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L146] var_1_18 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L147] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L148] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L148] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L149] var_1_19 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L150] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L151] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L151] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L152] var_1_22 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L153] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L154] var_1_23 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L155] RET assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L156] var_1_24 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_24 >= -922337.2036854776000e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854776000e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L157] RET assume_abort_if_not((var_1_24 >= -922337.2036854776000e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854776000e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L158] var_1_28 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L159] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L160] CALL assume_abort_if_not(var_1_28 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L160] RET assume_abort_if_not(var_1_28 <= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L175] RET updateVariables() [L176] CALL step() [L50] COND TRUE (last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16 [L51] var_1_1 = ((var_1_5 - 2) - var_1_6) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L55] COND TRUE 100.5f < var_1_22 [L56] var_1_27 = (! var_1_28) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L58] COND TRUE var_1_27 || var_1_27 [L59] var_1_12 = (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L61] signed long int stepLocal_5 = 2; [L62] unsigned char stepLocal_4 = var_1_5; [L63] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_3=1, stepLocal_4=198, stepLocal_5=2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L64] COND FALSE !(stepLocal_4 <= var_1_1) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_3=1, stepLocal_5=2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L67] COND TRUE stepLocal_3 || var_1_27 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_5=2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=16] [L68] COND TRUE stepLocal_5 < var_1_1 [L69] var_1_8 = var_1_6 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L73] COND FALSE !(! var_1_27) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L80] signed long int stepLocal_2 = ~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))); VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_2=-99, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L81] EXPR var_1_11 >> var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_2=-99, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L81] signed long int stepLocal_1 = var_1_11 >> var_1_1; [L82] unsigned char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, stepLocal_1=0, stepLocal_2=-99, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L83] COND TRUE var_1_5 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, stepLocal_1=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L84] COND FALSE !(var_1_1 <= stepLocal_1) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L94] COND TRUE (var_1_22 * -0.625) < (var_1_23 * var_1_24) [L95] var_1_21 = ((((var_1_13) < ((var_1_12 + (256 - var_1_8)))) ? (var_1_13) : ((var_1_12 + (256 - var_1_8))))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L101] COND FALSE !(var_1_7 > var_1_5) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L106] COND TRUE \read(var_1_27) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L107] COND FALSE !(var_1_29 >= ((var_1_1 + var_1_19) - ((((var_1_1) > (var_1_8)) ? (var_1_1) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L117] COND TRUE var_1_15 > var_1_25 [L118] var_1_16 = (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L120] EXPR var_1_16 | var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L120] EXPR (var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=-128, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L120] signed long int stepLocal_6 = (var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))); [L121] COND FALSE !(stepLocal_6 > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) [L124] var_1_20 = ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=98, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=104, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L176] RET step() [L177] CALL, EXPR property() [L167] EXPR (((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=104, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L167] EXPR (var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=104, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L167] EXPR var_1_11 >> var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=104, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L167] EXPR (var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=104, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L167] EXPR (var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=104, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L167] EXPR (((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=104, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L167] EXPR ((((((((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)))) && ((var_1_5 <= var_1_1) ? (var_1_8 == ((signed long int) (var_1_5 - var_1_6))) : ((var_1_27 || var_1_27) ? ((2 < var_1_1) ? (var_1_8 == ((signed long int) var_1_6)) : 1) : 1))) && ((! var_1_27) ? (((var_1_1 >= var_1_1) && var_1_27) ? (var_1_11 == ((unsigned char) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))))) : (var_1_11 == ((unsigned char) var_1_6))) : 1)) && ((var_1_27 || var_1_27) ? (var_1_12 == ((signed char) (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))))) : 1)) && ((var_1_15 > var_1_25) ? (var_1_16 == ((unsigned char) (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)))) : 1)) && ((((var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18)))) > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) ? (var_1_20 == ((signed short int) (var_1_5 - ((((var_1_11) > (1)) ? (var_1_11) : (1)))))) : (var_1_20 == ((signed short int) ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16)))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=104, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L167] EXPR var_1_16 | var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=104, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L167] EXPR (var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=104, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L167] EXPR ((((((((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)))) && ((var_1_5 <= var_1_1) ? (var_1_8 == ((signed long int) (var_1_5 - var_1_6))) : ((var_1_27 || var_1_27) ? ((2 < var_1_1) ? (var_1_8 == ((signed long int) var_1_6)) : 1) : 1))) && ((! var_1_27) ? (((var_1_1 >= var_1_1) && var_1_27) ? (var_1_11 == ((unsigned char) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))))) : (var_1_11 == ((unsigned char) var_1_6))) : 1)) && ((var_1_27 || var_1_27) ? (var_1_12 == ((signed char) (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))))) : 1)) && ((var_1_15 > var_1_25) ? (var_1_16 == ((unsigned char) (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)))) : 1)) && ((((var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18)))) > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) ? (var_1_20 == ((signed short int) (var_1_5 - ((((var_1_11) > (1)) ? (var_1_11) : (1)))))) : (var_1_20 == ((signed short int) ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16)))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=104, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L167-L168] return ((((((((((((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)))) && ((var_1_5 <= var_1_1) ? (var_1_8 == ((signed long int) (var_1_5 - var_1_6))) : ((var_1_27 || var_1_27) ? ((2 < var_1_1) ? (var_1_8 == ((signed long int) var_1_6)) : 1) : 1))) && ((! var_1_27) ? (((var_1_1 >= var_1_1) && var_1_27) ? (var_1_11 == ((unsigned char) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))))) : (var_1_11 == ((unsigned char) var_1_6))) : 1)) && ((var_1_27 || var_1_27) ? (var_1_12 == ((signed char) (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))))) : 1)) && ((var_1_15 > var_1_25) ? (var_1_16 == ((unsigned char) (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)))) : 1)) && ((((var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18)))) > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) ? (var_1_20 == ((signed short int) (var_1_5 - ((((var_1_11) > (1)) ? (var_1_11) : (1)))))) : (var_1_20 == ((signed short int) ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16))))) && (((var_1_22 * -0.625) < (var_1_23 * var_1_24)) ? (var_1_21 == ((signed short int) ((((var_1_13) < ((var_1_12 + (256 - var_1_8)))) ? (var_1_13) : ((var_1_12 + (256 - var_1_8))))))) : (var_1_27 ? (var_1_21 == ((signed short int) (((((((((var_1_12 + -1)) > (var_1_17)) ? ((var_1_12 + -1)) : (var_1_17)))) > ((var_1_13 + var_1_6))) ? ((((((var_1_12 + -1)) > (var_1_17)) ? ((var_1_12 + -1)) : (var_1_17)))) : ((var_1_13 + var_1_6)))))) : 1))) && (var_1_27 ? ((var_1_29 >= ((var_1_1 + var_1_19) - ((((var_1_1) > (var_1_8)) ? (var_1_1) : (var_1_8))))) ? (var_1_27 ? (var_1_25 == ((signed short int) var_1_17)) : (var_1_25 == ((signed short int) var_1_18))) : 1) : (var_1_25 == ((signed short int) var_1_14)))) && ((100.5f < var_1_22) ? (var_1_27 == ((unsigned char) (! var_1_28))) : 1)) && ((var_1_7 > var_1_5) ? (((var_1_21 <= var_1_6) || (var_1_27 || var_1_27)) ? (var_1_29 == ((signed short int) var_1_17)) : 1) : 1) ; [L177] RET, EXPR property() [L177] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=104, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=98, var_1_17=-155, var_1_18=257, var_1_19=-512, var_1_1=98, var_1_20=104, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=198, var_1_6=354, var_1_7=-2, var_1_8=98] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 171.5s, OverallIterations: 32, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 48.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10174 SdHoareTripleChecker+Valid, 33.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10135 mSDsluCounter, 17174 SdHoareTripleChecker+Invalid, 29.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11887 mSDsCounter, 407 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17576 IncrementalHoareTripleChecker+Invalid, 17983 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 407 mSolverCounterUnsat, 5287 mSDtfsCounter, 17576 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2355 GetRequests, 2033 SyntacticMatches, 3 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 21.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7435occurred in iteration=19, InterpolantAutomatonStates: 286, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 14809 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 110.2s InterpolantComputationTime, 5478 NumberOfCodeBlocks, 5478 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 5121 ConstructedInterpolants, 0 QuantifiedInterpolants, 46946 SizeOfPredicates, 2 NumberOfNonLiveVariables, 738 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 27186/27720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 17:32:24,263 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-08 17:32:24,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX --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 2761ad5b8b5d660ea43c0926578149a1a33205183f80a80f035b1bec4306cb62 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:32:27,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:32:27,452 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:32:27,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:32:27,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:32:27,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:32:27,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:32:27,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:32:27,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:32:27,521 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:32:27,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:32:27,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:32:27,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:32:27,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:32:27,526 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:32:27,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:32:27,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:32:27,528 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:32:27,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:32:27,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:32:27,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:32:27,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:32:27,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:32:27,535 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:32:27,535 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:32:27,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:32:27,536 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:32:27,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:32:27,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:32:27,541 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:32:27,542 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:32:27,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:32:27,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:32:27,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:32:27,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:32:27,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:32:27,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:32:27,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:32:27,547 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:32:27,548 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:32:27,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:32:27,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:32:27,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:32:27,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:32:27,563 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX 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 -> 2761ad5b8b5d660ea43c0926578149a1a33205183f80a80f035b1bec4306cb62 [2024-11-08 17:32:28,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:32:28,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:32:28,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:32:28,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:32:28,133 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:32:28,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i Unable to find full path for "g++" [2024-11-08 17:32:30,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:32:31,001 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:32:31,002 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i [2024-11-08 17:32:31,018 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/data/819aead4f/5337b1a54927492ba09ff461ac4d7d05/FLAG1930c6c86 [2024-11-08 17:32:31,048 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/data/819aead4f/5337b1a54927492ba09ff461ac4d7d05 [2024-11-08 17:32:31,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:32:31,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:32:31,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:32:31,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:32:31,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:32:31,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:32:31" (1/1) ... [2024-11-08 17:32:31,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a60c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:32:31, skipping insertion in model container [2024-11-08 17:32:31,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:32:31" (1/1) ... [2024-11-08 17:32:31,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:32:31,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i[916,929] [2024-11-08 17:32:31,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:32:31,643 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:32:31,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i[916,929] [2024-11-08 17:32:31,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:32:31,791 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:32:31,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:32:31 WrapperNode [2024-11-08 17:32:31,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:32:31,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:32:31,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:32:31,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:32:31,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:32:31" (1/1) ... [2024-11-08 17:32:31,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:32:31" (1/1) ... [2024-11-08 17:32:31,916 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 164 [2024-11-08 17:32:31,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:32:31,921 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:32:31,921 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:32:31,921 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:32:31,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:32:31" (1/1) ... [2024-11-08 17:32:31,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:32:31" (1/1) ... [2024-11-08 17:32:31,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:32:31" (1/1) ... [2024-11-08 17:32:31,964 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:32:31,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:32:31" (1/1) ... [2024-11-08 17:32:31,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:32:31" (1/1) ... [2024-11-08 17:32:31,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:32:31" (1/1) ... [2024-11-08 17:32:31,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:32:31" (1/1) ... [2024-11-08 17:32:31,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:32:31" (1/1) ... [2024-11-08 17:32:31,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:32:31" (1/1) ... [2024-11-08 17:32:31,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:32:31,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:32:31,998 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:32:31,998 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:32:31,999 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:32:31" (1/1) ... [2024-11-08 17:32:32,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:32:32,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:32:32,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:32:32,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:32:32,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:32:32,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:32:32,102 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:32:32,102 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:32:32,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:32:32,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:32:32,259 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:32:32,263 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:32:45,116 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 17:32:45,116 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:32:45,134 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:32:45,135 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:32:45,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:32:45 BoogieIcfgContainer [2024-11-08 17:32:45,136 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:32:45,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:32:45,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:32:45,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:32:45,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:32:31" (1/3) ... [2024-11-08 17:32:45,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2388fb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:32:45, skipping insertion in model container [2024-11-08 17:32:45,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:32:31" (2/3) ... [2024-11-08 17:32:45,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2388fb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:32:45, skipping insertion in model container [2024-11-08 17:32:45,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:32:45" (3/3) ... [2024-11-08 17:32:45,153 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-59.i [2024-11-08 17:32:45,179 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:32:45,179 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:32:45,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:32:45,288 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;@23869f58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:32:45,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:32:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 17:32:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:32:45,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:32:45,313 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:32:45,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:32:45,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:32:45,321 INFO L85 PathProgramCache]: Analyzing trace with hash -21987327, now seen corresponding path program 1 times [2024-11-08 17:32:45,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:32:45,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535058039] [2024-11-08 17:32:45,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:32:45,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:32:45,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:32:45,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:32:45,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 17:32:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:46,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:32:46,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:32:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-08 17:32:46,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:32:46,228 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:32:46,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535058039] [2024-11-08 17:32:46,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535058039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:32:46,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:32:46,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:32:46,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123109996] [2024-11-08 17:32:46,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:32:46,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:32:46,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:32:46,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:32:46,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:32:46,284 INFO L87 Difference]: Start difference. First operand has 75 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:32:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:32:46,343 INFO L93 Difference]: Finished difference Result 143 states and 251 transitions. [2024-11-08 17:32:46,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:32:46,346 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 140 [2024-11-08 17:32:46,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:32:46,361 INFO L225 Difference]: With dead ends: 143 [2024-11-08 17:32:46,361 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 17:32:46,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:32:46,376 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:32:46,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:32:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 17:32:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-08 17:32:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 17:32:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2024-11-08 17:32:46,462 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 140 [2024-11-08 17:32:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:32:46,464 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2024-11-08 17:32:46,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:32:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2024-11-08 17:32:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:32:46,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:32:46,496 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:32:46,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 17:32:46,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:32:46,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:32:46,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:32:46,700 INFO L85 PathProgramCache]: Analyzing trace with hash 423617095, now seen corresponding path program 1 times [2024-11-08 17:32:46,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:32:46,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965549171] [2024-11-08 17:32:46,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:32:46,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:32:46,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:32:46,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:32:46,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 17:32:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:32:47,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:32:47,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:32:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-08 17:32:47,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:32:47,780 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:32:47,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965549171] [2024-11-08 17:32:47,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965549171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:32:47,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:32:47,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:32:47,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757888904] [2024-11-08 17:32:47,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:32:47,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:32:47,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:32:47,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:32:47,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:32:47,788 INFO L87 Difference]: Start difference. First operand 71 states and 111 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:32:53,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:32:57,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:32:59,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:32:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:32:59,664 INFO L93 Difference]: Finished difference Result 146 states and 224 transitions. [2024-11-08 17:32:59,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:32:59,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2024-11-08 17:32:59,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:32:59,704 INFO L225 Difference]: With dead ends: 146 [2024-11-08 17:32:59,705 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 17:32:59,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:32:59,711 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 116 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 88 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:32:59,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 166 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 11.4s Time] [2024-11-08 17:32:59,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 17:32:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-08 17:32:59,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 17:32:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2024-11-08 17:32:59,737 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 140 [2024-11-08 17:32:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:32:59,739 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2024-11-08 17:32:59,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:32:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2024-11-08 17:32:59,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 17:32:59,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:32:59,743 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:32:59,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -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-11-08 17:32:59,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:32:59,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:32:59,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:32:59,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1000059585, now seen corresponding path program 1 times [2024-11-08 17:32:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:32:59,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274649163] [2024-11-08 17:32:59,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:32:59,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:32:59,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:32:59,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:32:59,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 17:33:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:33:00,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 17:33:00,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:33:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:33:00,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:33:00,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:33:00,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274649163] [2024-11-08 17:33:00,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274649163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:33:00,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:33:00,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:33:00,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436502623] [2024-11-08 17:33:00,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:33:00,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:33:00,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:33:00,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:33:00,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:33:00,656 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:33:04,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:33:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:33:04,837 INFO L93 Difference]: Finished difference Result 145 states and 207 transitions. [2024-11-08 17:33:04,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:33:04,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2024-11-08 17:33:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:33:04,875 INFO L225 Difference]: With dead ends: 145 [2024-11-08 17:33:04,875 INFO L226 Difference]: Without dead ends: 74 [2024-11-08 17:33:04,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 139 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-11-08 17:33:04,878 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:33:04,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 17:33:04,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-08 17:33:04,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-08 17:33:04,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 17:33:04,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2024-11-08 17:33:04,899 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 141 [2024-11-08 17:33:04,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:33:04,900 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2024-11-08 17:33:04,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:33:04,901 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2024-11-08 17:33:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 17:33:04,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:33:04,905 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:33:04,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 17:33:05,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:33:05,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:33:05,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:33:05,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1548349162, now seen corresponding path program 1 times [2024-11-08 17:33:05,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:33:05,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101823183] [2024-11-08 17:33:05,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:33:05,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:33:05,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:33:05,112 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:33:05,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 17:33:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:33:05,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 17:33:05,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:33:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 182 proven. 108 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-08 17:33:08,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:33:10,169 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:33:10,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101823183] [2024-11-08 17:33:10,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101823183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:33:10,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456072955] [2024-11-08 17:33:10,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:33:10,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:33:10,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:33:10,175 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:33:10,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 17:33:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:33:10,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 17:33:10,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:33:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 136 proven. 159 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2024-11-08 17:33:14,578 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:33:15,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456072955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:33:15,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:33:15,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2024-11-08 17:33:15,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417177823] [2024-11-08 17:33:15,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:33:15,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:33:15,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:33:15,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:33:15,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:33:15,450 INFO L87 Difference]: Start difference. First operand 74 states and 104 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 5 states have call successors, (40), 5 states have call predecessors, (40), 7 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) [2024-11-08 17:33:23,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:33:27,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:33:29,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:33:33,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:33:35,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:33:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:33:35,556 INFO L93 Difference]: Finished difference Result 192 states and 259 transitions. [2024-11-08 17:33:35,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:33:35,557 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 5 states have call successors, (40), 5 states have call predecessors, (40), 7 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) Word has length 142 [2024-11-08 17:33:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:33:35,560 INFO L225 Difference]: With dead ends: 192 [2024-11-08 17:33:35,560 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 17:33:35,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2024-11-08 17:33:35,563 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 171 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:33:35,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 404 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 558 Invalid, 3 Unknown, 0 Unchecked, 19.5s Time] [2024-11-08 17:33:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 17:33:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 90. [2024-11-08 17:33:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 63 states have internal predecessors, (76), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 17:33:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2024-11-08 17:33:35,599 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 142 [2024-11-08 17:33:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:33:35,603 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2024-11-08 17:33:35,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 5 states have call successors, (40), 5 states have call predecessors, (40), 7 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) [2024-11-08 17:33:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2024-11-08 17:33:35,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 17:33:35,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:33:35,611 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:33:35,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 17:33:35,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 17:33:36,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:33:36,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:33:36,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:33:36,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1928969684, now seen corresponding path program 1 times [2024-11-08 17:33:36,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:33:36,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231636389] [2024-11-08 17:33:36,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:33:36,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:33:36,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:33:36,018 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:33:36,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 17:33:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:33:36,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:33:36,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:33:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:33:37,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:33:37,604 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:33:37,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231636389] [2024-11-08 17:33:37,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231636389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:33:37,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:33:37,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:33:37,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745407095] [2024-11-08 17:33:37,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:33:37,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:33:37,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:33:37,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:33:37,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:33:37,608 INFO L87 Difference]: Start difference. First operand 90 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:33:41,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:33:45,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:33:50,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:33:54,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:33:58,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:34:02,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:34:06,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:34:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:34:06,926 INFO L93 Difference]: Finished difference Result 282 states and 371 transitions. [2024-11-08 17:34:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:34:06,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2024-11-08 17:34:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:34:06,957 INFO L225 Difference]: With dead ends: 282 [2024-11-08 17:34:06,957 INFO L226 Difference]: Without dead ends: 195 [2024-11-08 17:34:06,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:34:06,959 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 120 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 43 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:34:06,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 282 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 13 Invalid, 7 Unknown, 0 Unchecked, 29.2s Time] [2024-11-08 17:34:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-08 17:34:06,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 171. [2024-11-08 17:34:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 118 states have (on average 1.194915254237288) internal successors, (141), 118 states have internal predecessors, (141), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 17:34:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 225 transitions. [2024-11-08 17:34:06,996 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 225 transitions. Word has length 142 [2024-11-08 17:34:06,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:34:06,997 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 225 transitions. [2024-11-08 17:34:06,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:34:06,997 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 225 transitions. [2024-11-08 17:34:06,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 17:34:06,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:34:07,000 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:34:07,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -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-11-08 17:34:07,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:34:07,201 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:34:07,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:34:07,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1431456527, now seen corresponding path program 1 times [2024-11-08 17:34:07,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:34:07,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502994204] [2024-11-08 17:34:07,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:34:07,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:34:07,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:34:07,203 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:34:07,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 17:34:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:34:07,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 17:34:07,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:34:10,022 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 182 proven. 108 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-08 17:34:10,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:34:10,888 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:34:10,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502994204] [2024-11-08 17:34:10,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502994204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:34:10,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964683783] [2024-11-08 17:34:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:34:10,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:34:10,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:34:10,890 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:34:10,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 17:34:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:34:11,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 17:34:11,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:34:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 182 proven. 108 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-08 17:34:13,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:34:13,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964683783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:34:13,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:34:13,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-08 17:34:13,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742427408] [2024-11-08 17:34:13,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:34:13,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:34:13,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:34:13,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:34:13,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:34:13,862 INFO L87 Difference]: Start difference. First operand 171 states and 225 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-08 17:34:19,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:34:23,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:34:26,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:34:37,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:34:37,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:34:37,823 INFO L93 Difference]: Finished difference Result 417 states and 542 transitions. [2024-11-08 17:34:37,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 17:34:37,866 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 144 [2024-11-08 17:34:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:34:37,868 INFO L225 Difference]: With dead ends: 417 [2024-11-08 17:34:37,869 INFO L226 Difference]: Without dead ends: 249 [2024-11-08 17:34:37,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=204, Invalid=608, Unknown=0, NotChecked=0, Total=812 [2024-11-08 17:34:37,871 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 127 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 45 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:34:37,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 349 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 567 Invalid, 3 Unknown, 0 Unchecked, 22.5s Time] [2024-11-08 17:34:37,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-08 17:34:37,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 148. [2024-11-08 17:34:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 95 states have internal predecessors, (108), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 17:34:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 192 transitions. [2024-11-08 17:34:37,950 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 192 transitions. Word has length 144 [2024-11-08 17:34:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:34:37,954 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 192 transitions. [2024-11-08 17:34:37,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-08 17:34:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 192 transitions. [2024-11-08 17:34:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 17:34:37,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:34:37,961 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:34:37,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-08 17:34:38,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 17:34:38,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:34:38,363 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:34:38,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:34:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1842442415, now seen corresponding path program 1 times [2024-11-08 17:34:38,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:34:38,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612934745] [2024-11-08 17:34:38,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:34:38,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:34:38,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:34:38,366 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:34:38,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_485703a5-a463-4840-86e7-84ff3ddeea53/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-08 17:34:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:34:38,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 17:34:38,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:35:06,516 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:35:12,846 WARN L286 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:35:20,974 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:35:26,497 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:35:35,850 WARN L286 SmtUtils]: Spent 6.89s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:35:43,994 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:35:52,127 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:36:00,267 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:36:08,391 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:36:15,271 WARN L286 SmtUtils]: Spent 6.88s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:36:23,164 WARN L286 SmtUtils]: Spent 7.89s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:36:32,467 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:36:39,689 WARN L286 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:36:46,188 WARN L286 SmtUtils]: Spent 6.50s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:37:02,374 WARN L286 SmtUtils]: Spent 7.71s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:37:10,476 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:37:15,840 WARN L286 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:37:19,874 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_13~0)) (.cse4 ((_ zero_extend 24) c_~var_1_5~0)) (.cse7 ((_ zero_extend 24) c_~var_1_6~0))) (and (let ((.cse1 ((_ sign_extend 24) c_~var_1_14~0)) (.cse3 ((_ sign_extend 24) c_~var_1_15~0))) (let ((.cse2 (bvslt .cse1 .cse3))) (or (and (= c_~var_1_12~0 ((_ extract 7 0) (bvadd .cse0 .cse1))) .cse2) (and (= c_~var_1_12~0 ((_ extract 7 0) (bvadd .cse0 .cse3))) (not .cse2))))) (bvsge .cse4 (_ bv190 32)) (= (_ bv1 8) c_~var_1_11~0) (let ((.cse5 (bvadd ((_ sign_extend 24) c_~var_1_12~0) (_ bv256 32) (bvneg c_~var_1_8~0)))) (let ((.cse6 (bvslt .cse0 .cse5))) (or (and (= c_~var_1_21~0 ((_ extract 15 0) .cse5)) (not .cse6)) (and .cse6 (= ((_ extract 15 0) .cse0) c_~var_1_21~0))))) (= (_ bv1 8) c_~var_1_27~0) (= ((_ extract 7 0) (bvadd (bvneg .cse7) .cse4 (_ bv4294967294 32))) c_~var_1_1~0) (bvsle ((_ zero_extend 24) c_~var_1_28~0) (_ bv0 32)) (= (_ bv5 8) c_~var_1_16~0) (fp.lt (fp.mul c_currentRoundingMode c_~var_1_22~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 8.0)))) (fp.mul c_currentRoundingMode c_~var_1_23~0 c_~var_1_24~0)) (= (_ bv16 32) c_~last_1_var_1_8~0) (= (bvadd (_ bv2 16) c_~var_1_7~0) (_ bv0 16)) (bvsle ((_ zero_extend 24) c_~var_1_18~0) (_ bv32 32)) (bvsle ((_ zero_extend 24) c_~var_1_19~0) (_ bv63 32)) (= (_ bv0 16) (bvadd (_ bv8 16) c_~var_1_29~0)) (= c_~var_1_8~0 .cse7) (bvsle .cse7 (_ bv127 32)))) is different from false [2024-11-08 17:37:23,905 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_13~0)) (.cse4 ((_ zero_extend 24) c_~var_1_5~0)) (.cse7 ((_ zero_extend 24) c_~var_1_6~0))) (and (let ((.cse1 ((_ sign_extend 24) c_~var_1_14~0)) (.cse3 ((_ sign_extend 24) c_~var_1_15~0))) (let ((.cse2 (bvslt .cse1 .cse3))) (or (and (= c_~var_1_12~0 ((_ extract 7 0) (bvadd .cse0 .cse1))) .cse2) (and (= c_~var_1_12~0 ((_ extract 7 0) (bvadd .cse0 .cse3))) (not .cse2))))) (bvsge .cse4 (_ bv190 32)) (= (_ bv1 8) c_~var_1_11~0) (let ((.cse5 (bvadd ((_ sign_extend 24) c_~var_1_12~0) (_ bv256 32) (bvneg c_~var_1_8~0)))) (let ((.cse6 (bvslt .cse0 .cse5))) (or (and (= c_~var_1_21~0 ((_ extract 15 0) .cse5)) (not .cse6)) (and .cse6 (= ((_ extract 15 0) .cse0) c_~var_1_21~0))))) (= (_ bv1 8) c_~var_1_27~0) (= ((_ extract 7 0) (bvadd (bvneg .cse7) .cse4 (_ bv4294967294 32))) c_~var_1_1~0) (bvsle ((_ zero_extend 24) c_~var_1_28~0) (_ bv0 32)) (= (_ bv5 8) c_~var_1_16~0) (fp.lt (fp.mul c_currentRoundingMode c_~var_1_22~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 8.0)))) (fp.mul c_currentRoundingMode c_~var_1_23~0 c_~var_1_24~0)) (= (_ bv16 32) c_~last_1_var_1_8~0) (= (bvadd (_ bv2 16) c_~var_1_7~0) (_ bv0 16)) (bvsle ((_ zero_extend 24) c_~var_1_18~0) (_ bv32 32)) (bvsle ((_ zero_extend 24) c_~var_1_19~0) (_ bv63 32)) (= (_ bv0 16) (bvadd (_ bv8 16) c_~var_1_29~0)) (= c_~var_1_8~0 .cse7) (bvsle .cse7 (_ bv127 32)))) is different from true [2024-11-08 17:37:31,562 WARN L286 SmtUtils]: Spent 7.63s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:37:39,622 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:38:01,129 WARN L286 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:38:07,397 WARN L286 SmtUtils]: Spent 6.27s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:38:15,501 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:38:27,795 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:38:35,891 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:38:42,573 WARN L286 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:38:49,138 WARN L286 SmtUtils]: Spent 6.57s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:39:01,089 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:39:07,412 WARN L286 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:39:18,156 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:39:26,256 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:39:31,545 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:39:39,443 WARN L286 SmtUtils]: Spent 7.87s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:39:47,504 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:39:55,604 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:40:03,704 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:40:11,801 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:40:19,901 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:40:26,593 WARN L286 SmtUtils]: Spent 6.69s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:40:38,245 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:40:46,346 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:40:58,540 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:41:07,485 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:41:13,907 WARN L286 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:41:21,846 WARN L286 SmtUtils]: Spent 7.94s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:41:29,949 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:41:35,794 WARN L286 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:41:43,895 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:41:56,996 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:42:02,316 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:42:10,383 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:42:18,038 WARN L286 SmtUtils]: Spent 7.65s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:42:26,141 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:42:39,750 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:42:50,112 WARN L286 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:42:58,212 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:43:05,013 WARN L286 SmtUtils]: Spent 6.80s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)