./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya --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 310044b99b6a4c9305f92a655bab82629ffb49bf202c9a3228cdf9c518cca452 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:03:54,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:03:54,710 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:03:54,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:03:54,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:03:54,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:03:54,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:03:54,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:03:54,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:03:54,743 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:03:54,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:03:54,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:03:54,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:03:54,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:03:54,746 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:03:54,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:03:54,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:03:54,747 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:03:54,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:03:54,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:03:54,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:03:54,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:03:54,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:03:54,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:03:54,750 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:03:54,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:03:54,751 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:03:54,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:03:54,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:03:54,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:03:54,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:03:54,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:03:54,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:03:54,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:03:54,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:03:54,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:03:54,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:03:54,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:03:54,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:03:54,755 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:03:54,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:03:54,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:03:54,755 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_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/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_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 310044b99b6a4c9305f92a655bab82629ffb49bf202c9a3228cdf9c518cca452 [2023-11-29 00:03:54,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:03:55,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:03:55,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:03:55,016 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:03:55,017 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:03:55,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i [2023-11-29 00:03:57,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:03:58,005 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:03:58,006 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i [2023-11-29 00:03:58,016 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/data/a8860de2b/8213ccad81074a4da0579b68894610be/FLAG0432e2c2b [2023-11-29 00:03:58,029 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/data/a8860de2b/8213ccad81074a4da0579b68894610be [2023-11-29 00:03:58,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:03:58,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:03:58,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:03:58,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:03:58,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:03:58,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3736f85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58, skipping insertion in model container [2023-11-29 00:03:58,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,074 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:03:58,206 WARN L240 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_cb822ae7-63bb-4fea-9e70-ab3eb0466906/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i[919,932] [2023-11-29 00:03:58,269 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:03:58,281 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:03:58,295 WARN L240 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_cb822ae7-63bb-4fea-9e70-ab3eb0466906/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i[919,932] [2023-11-29 00:03:58,331 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:03:58,350 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:03:58,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58 WrapperNode [2023-11-29 00:03:58,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:03:58,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:03:58,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:03:58,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:03:58,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,409 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2023-11-29 00:03:58,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:03:58,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:03:58,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:03:58,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:03:58,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,444 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]. [2023-11-29 00:03:58,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:03:58,470 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:03:58,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:03:58,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:03:58,471 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (1/1) ... [2023-11-29 00:03:58,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:03:58,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:03:58,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:03:58,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:03:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:03:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:03:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:03:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:03:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:03:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:03:58,643 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:03:58,646 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:03:59,004 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:03:59,047 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:03:59,047 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:03:59,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:59 BoogieIcfgContainer [2023-11-29 00:03:59,048 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:03:59,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:03:59,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:03:59,054 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:03:59,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:03:58" (1/3) ... [2023-11-29 00:03:59,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443d8934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:03:59, skipping insertion in model container [2023-11-29 00:03:59,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:58" (2/3) ... [2023-11-29 00:03:59,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443d8934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:03:59, skipping insertion in model container [2023-11-29 00:03:59,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:59" (3/3) ... [2023-11-29 00:03:59,057 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i [2023-11-29 00:03:59,074 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:03:59,074 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:03:59,120 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:03:59,127 INFO L357 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, mHoare=true, 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;@62ac1e52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:03:59,127 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:03:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 56 states have internal predecessors, (86), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 00:03:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-29 00:03:59,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:59,151 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:59,151 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:03:59,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:59,157 INFO L85 PathProgramCache]: Analyzing trace with hash -789277552, now seen corresponding path program 1 times [2023-11-29 00:03:59,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:59,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060518646] [2023-11-29 00:03:59,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:03:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:03:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:03:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:03:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:03:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:03:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:03:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:03:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:03:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:03:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:03:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:03:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:03:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:03:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:03:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:03:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:03:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:03:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:03:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:03:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:03:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 00:03:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:03:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:03:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:03:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:03:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-29 00:03:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-11-29 00:03:59,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:03:59,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060518646] [2023-11-29 00:03:59,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060518646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:59,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:59,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:03:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38935675] [2023-11-29 00:03:59,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:59,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:03:59,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:03:59,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:03:59,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:03:59,638 INFO L87 Difference]: Start difference. First operand has 85 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 56 states have internal predecessors, (86), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2023-11-29 00:03:59,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:59,689 INFO L93 Difference]: Finished difference Result 167 states and 305 transitions. [2023-11-29 00:03:59,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:03:59,692 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 170 [2023-11-29 00:03:59,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:59,699 INFO L225 Difference]: With dead ends: 167 [2023-11-29 00:03:59,700 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 00:03:59,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:03:59,707 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:59,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:03:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 00:03:59,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-29 00:03:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 54 states have internal predecessors, (80), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 00:03:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 134 transitions. [2023-11-29 00:03:59,756 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 134 transitions. Word has length 170 [2023-11-29 00:03:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:59,757 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 134 transitions. [2023-11-29 00:03:59,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2023-11-29 00:03:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 134 transitions. [2023-11-29 00:03:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-29 00:03:59,762 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:59,763 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:59,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:03:59,763 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:03:59,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:59,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1705986760, now seen corresponding path program 1 times [2023-11-29 00:03:59,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:03:59,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393750630] [2023-11-29 00:03:59,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:59,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:03:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:03:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:59,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:03:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:04:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:04:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:04:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:04:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:04:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:04:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:04:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:04:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:04:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:04:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:04:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:04:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:04:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:04:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:04:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:04:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:04:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:04:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:04:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 00:04:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:04:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:04:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:04:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:04:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-29 00:04:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-11-29 00:04:00,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:04:00,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393750630] [2023-11-29 00:04:00,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393750630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:00,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:00,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:04:00,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605673452] [2023-11-29 00:04:00,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:00,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:04:00,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:04:00,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:04:00,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:04:00,093 INFO L87 Difference]: Start difference. First operand 83 states and 134 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-29 00:04:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:04:00,162 INFO L93 Difference]: Finished difference Result 244 states and 394 transitions. [2023-11-29 00:04:00,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:04:00,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2023-11-29 00:04:00,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:04:00,167 INFO L225 Difference]: With dead ends: 244 [2023-11-29 00:04:00,167 INFO L226 Difference]: Without dead ends: 162 [2023-11-29 00:04:00,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:04:00,170 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 116 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:04:00,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 331 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:04:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-29 00:04:00,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 97. [2023-11-29 00:04:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 68 states have internal predecessors, (103), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 00:04:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 157 transitions. [2023-11-29 00:04:00,190 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 157 transitions. Word has length 170 [2023-11-29 00:04:00,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:04:00,193 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 157 transitions. [2023-11-29 00:04:00,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-29 00:04:00,193 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 157 transitions. [2023-11-29 00:04:00,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-29 00:04:00,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:04:00,197 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:00,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:04:00,197 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:04:00,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:00,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1763245062, now seen corresponding path program 1 times [2023-11-29 00:04:00,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:04:00,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99700271] [2023-11-29 00:04:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:00,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:04:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:04:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:04:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:04:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:04:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:04:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:04:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:04:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:04:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:04:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:04:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:04:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:04:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:04:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:04:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:04:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:04:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:04:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:04:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:04:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:04:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:04:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 00:04:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:04:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:04:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:04:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:04:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-29 00:04:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-11-29 00:04:01,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:04:01,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99700271] [2023-11-29 00:04:01,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99700271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:01,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:01,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:04:01,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904796199] [2023-11-29 00:04:01,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:01,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:04:01,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:04:01,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:04:01,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:04:01,210 INFO L87 Difference]: Start difference. First operand 97 states and 157 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-29 00:04:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:04:01,307 INFO L93 Difference]: Finished difference Result 217 states and 353 transitions. [2023-11-29 00:04:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:04:01,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2023-11-29 00:04:01,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:04:01,311 INFO L225 Difference]: With dead ends: 217 [2023-11-29 00:04:01,311 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 00:04:01,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:04:01,314 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 140 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:04:01,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 339 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:04:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 00:04:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2023-11-29 00:04:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.5) internal successors, (102), 68 states have internal predecessors, (102), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 00:04:01,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 156 transitions. [2023-11-29 00:04:01,330 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 156 transitions. Word has length 170 [2023-11-29 00:04:01,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:04:01,331 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 156 transitions. [2023-11-29 00:04:01,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-29 00:04:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 156 transitions. [2023-11-29 00:04:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-29 00:04:01,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:04:01,335 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:01,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:04:01,335 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:04:01,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:01,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2021410500, now seen corresponding path program 1 times [2023-11-29 00:04:01,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:04:01,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181047645] [2023-11-29 00:04:01,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:01,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:04:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:04:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:04:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:04:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:04:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:04:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:04:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:04:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:04:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:04:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:04:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:04:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:04:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:04:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:04:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:04:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:04:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:04:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:04:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:04:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:04:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:04:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 00:04:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:04:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:04:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:04:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:04:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-29 00:04:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-11-29 00:04:01,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:04:01,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181047645] [2023-11-29 00:04:01,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181047645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:01,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:01,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:04:01,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75457658] [2023-11-29 00:04:01,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:01,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:04:01,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:04:01,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:04:01,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:04:01,836 INFO L87 Difference]: Start difference. First operand 97 states and 156 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-29 00:04:02,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:04:02,133 INFO L93 Difference]: Finished difference Result 290 states and 467 transitions. [2023-11-29 00:04:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:04:02,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2023-11-29 00:04:02,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:04:02,136 INFO L225 Difference]: With dead ends: 290 [2023-11-29 00:04:02,137 INFO L226 Difference]: Without dead ends: 194 [2023-11-29 00:04:02,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:04:02,139 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 142 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:04:02,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 448 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:04:02,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-11-29 00:04:02,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 145. [2023-11-29 00:04:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 00:04:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 230 transitions. [2023-11-29 00:04:02,166 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 230 transitions. Word has length 170 [2023-11-29 00:04:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:04:02,167 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 230 transitions. [2023-11-29 00:04:02,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-29 00:04:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 230 transitions. [2023-11-29 00:04:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 00:04:02,170 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:04:02,170 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:02,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:04:02,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:04:02,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:02,171 INFO L85 PathProgramCache]: Analyzing trace with hash -817953876, now seen corresponding path program 1 times [2023-11-29 00:04:02,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:04:02,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347223503] [2023-11-29 00:04:02,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:02,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:04:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:04:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:04:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:04:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:04:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:04:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:04:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:04:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:04:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:04:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:04:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:04:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:04:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:04:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:04:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:04:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:04:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:04:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:04:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:04:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:04:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:04:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 00:04:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:04:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:04:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:04:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:04:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-29 00:04:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-11-29 00:04:05,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:04:05,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347223503] [2023-11-29 00:04:05,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347223503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:05,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:05,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:04:05,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899426642] [2023-11-29 00:04:05,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:05,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:04:05,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:04:05,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:04:05,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:04:05,333 INFO L87 Difference]: Start difference. First operand 145 states and 230 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-29 00:04:05,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:04:05,770 INFO L93 Difference]: Finished difference Result 299 states and 467 transitions. [2023-11-29 00:04:05,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:04:05,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2023-11-29 00:04:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:04:05,774 INFO L225 Difference]: With dead ends: 299 [2023-11-29 00:04:05,774 INFO L226 Difference]: Without dead ends: 203 [2023-11-29 00:04:05,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:04:05,775 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 162 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:04:05,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 341 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:04:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-29 00:04:05,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 155. [2023-11-29 00:04:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 00:04:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 240 transitions. [2023-11-29 00:04:05,807 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 240 transitions. Word has length 171 [2023-11-29 00:04:05,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:04:05,808 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 240 transitions. [2023-11-29 00:04:05,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-29 00:04:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 240 transitions. [2023-11-29 00:04:05,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 00:04:05,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:04:05,811 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:05,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:04:05,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:04:05,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:05,812 INFO L85 PathProgramCache]: Analyzing trace with hash -137895506, now seen corresponding path program 1 times [2023-11-29 00:04:05,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:04:05,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491175512] [2023-11-29 00:04:05,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:05,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:04:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:04:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:04:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:04:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:04:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:04:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:04:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:04:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:04:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:04:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:04:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:04:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:04:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:04:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:04:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:04:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:04:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:04:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:04:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:04:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:04:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:04:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 00:04:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:04:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:04:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:04:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:04:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-29 00:04:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-11-29 00:04:06,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:04:06,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491175512] [2023-11-29 00:04:06,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491175512] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:04:06,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115461892] [2023-11-29 00:04:06,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:06,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:04:06,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:04:06,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:04:06,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:04:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:06,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:04:06,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2023-11-29 00:04:07,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:04:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-11-29 00:04:07,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115461892] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:04:07,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:04:07,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-11-29 00:04:07,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523685327] [2023-11-29 00:04:07,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:04:07,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:04:07,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:04:07,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:04:07,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:04:07,390 INFO L87 Difference]: Start difference. First operand 155 states and 240 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2023-11-29 00:04:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:04:07,770 INFO L93 Difference]: Finished difference Result 259 states and 392 transitions. [2023-11-29 00:04:07,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:04:07,771 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 171 [2023-11-29 00:04:07,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:04:07,773 INFO L225 Difference]: With dead ends: 259 [2023-11-29 00:04:07,773 INFO L226 Difference]: Without dead ends: 153 [2023-11-29 00:04:07,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 391 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2023-11-29 00:04:07,775 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 220 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:04:07,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 222 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:04:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-29 00:04:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2023-11-29 00:04:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 54 states have call successors, (54), 5 states have call predecessors, (54), 5 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 00:04:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2023-11-29 00:04:07,820 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 171 [2023-11-29 00:04:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:04:07,820 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2023-11-29 00:04:07,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2023-11-29 00:04:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2023-11-29 00:04:07,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-11-29 00:04:07,822 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:04:07,823 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:07,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:04:08,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 00:04:08,024 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:04:08,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1222622707, now seen corresponding path program 1 times [2023-11-29 00:04:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:04:08,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094256637] [2023-11-29 00:04:08,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:08,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:04:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:29,977 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 193 DAG size of output: 184 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:04:44,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:04:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:04:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:04:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:04:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:04:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:04:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:04:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:04:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:04:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:04:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:04:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:04:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:04:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:04:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:04:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:04:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:04:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:04:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:04:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:04:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:04:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 00:04:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:04:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:04:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:04:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:04:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-29 00:04:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-11-29 00:04:44,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:04:44,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094256637] [2023-11-29 00:04:44,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094256637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:04:44,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:04:44,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 00:04:44,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983167421] [2023-11-29 00:04:44,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:04:44,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 00:04:44,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:04:44,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 00:04:44,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:04:44,523 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2023-11-29 00:05:06,641 WARN L293 SmtUtils]: Spent 16.39s on a formula simplification. DAG size of input: 224 DAG size of output: 186 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:05:27,472 WARN L293 SmtUtils]: Spent 19.55s on a formula simplification. DAG size of input: 223 DAG size of output: 185 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:06:14,907 WARN L293 SmtUtils]: Spent 45.49s on a formula simplification. DAG size of input: 271 DAG size of output: 213 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:06:16,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:07:03,744 WARN L293 SmtUtils]: Spent 47.09s on a formula simplification. DAG size of input: 270 DAG size of output: 212 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:07:55,968 WARN L293 SmtUtils]: Spent 51.47s on a formula simplification. DAG size of input: 279 DAG size of output: 213 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:08:39,957 WARN L293 SmtUtils]: Spent 42.54s on a formula simplification. DAG size of input: 278 DAG size of output: 212 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:09:40,696 WARN L293 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 334 DAG size of output: 244 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:10:19,562 WARN L293 SmtUtils]: Spent 37.67s on a formula simplification. DAG size of input: 333 DAG size of output: 243 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:11:39,626 WARN L293 SmtUtils]: Spent 1.31m on a formula simplification. DAG size of input: 378 DAG size of output: 282 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:13:11,330 WARN L293 SmtUtils]: Spent 1.50m on a formula simplification. DAG size of input: 377 DAG size of output: 279 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:14:12,026 WARN L293 SmtUtils]: Spent 1.00m on a formula simplification. DAG size of input: 302 DAG size of output: 154 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:15:03,234 WARN L293 SmtUtils]: Spent 49.05s on a formula simplification. DAG size of input: 301 DAG size of output: 153 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:15:06,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:15:11,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:15:17,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:15:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:15:18,587 INFO L93 Difference]: Finished difference Result 770 states and 1110 transitions. [2023-11-29 00:15:18,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 00:15:18,588 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 172 [2023-11-29 00:15:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:15:18,593 INFO L225 Difference]: With dead ends: 770 [2023-11-29 00:15:18,593 INFO L226 Difference]: Without dead ends: 680 [2023-11-29 00:15:18,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 621.3s TimeCoverageRelationStatistics Valid=305, Invalid=687, Unknown=0, NotChecked=0, Total=992 [2023-11-29 00:15:18,595 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 2626 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 429 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2626 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:15:18,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2626 Valid, 838 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1113 Invalid, 1 Unknown, 0 Unchecked, 25.1s Time] [2023-11-29 00:15:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2023-11-29 00:15:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 294. [2023-11-29 00:15:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 193 states have (on average 1.3316062176165804) internal successors, (257), 194 states have internal predecessors, (257), 87 states have call successors, (87), 13 states have call predecessors, (87), 13 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2023-11-29 00:15:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 431 transitions. [2023-11-29 00:15:18,695 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 431 transitions. Word has length 172 [2023-11-29 00:15:18,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:15:18,696 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 431 transitions. [2023-11-29 00:15:18,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2023-11-29 00:15:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 431 transitions. [2023-11-29 00:15:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-11-29 00:15:18,698 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:15:18,699 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:15:18,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:15:18,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:15:18,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:15:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash -542564337, now seen corresponding path program 1 times [2023-11-29 00:15:18,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:15:18,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394481383] [2023-11-29 00:15:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:18,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:15:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:15:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:15:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:15:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:15:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:15:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:15:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:15:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:15:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:15:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:15:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:15:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:15:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:15:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:15:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 00:15:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 00:15:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 00:15:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 00:15:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:15:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 00:15:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:15:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 00:15:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 00:15:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:15:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 00:15:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 00:15:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-29 00:15:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 90 proven. 240 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2023-11-29 00:15:21,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:15:21,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394481383] [2023-11-29 00:15:21,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394481383] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:21,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904742968] [2023-11-29 00:15:21,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:21,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:15:21,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:15:21,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:15:21,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb822ae7-63bb-4fea-9e70-ab3eb0466906/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:15:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:22,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 00:15:22,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:15:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 668 proven. 282 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2023-11-29 00:15:24,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:15:39,300 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:15:49,493 WARN L293 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:16:01,553 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:16:13,987 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_~var_1_9~0 4294967295)) (.cse4 (mod c_~var_1_11~0 4294967296)) (.cse2 (mod c_~var_1_7~0 4294967296))) (or (let ((.cse1 (* 4294967295 (mod .cse3 4294967296)))) (let ((.cse0 (* 4294967296 (div (+ (- 18446744068340842498) .cse1) 4294967296)))) (and (<= (+ .cse0 18446744071562067969) .cse1) (<= (+ .cse0 18446744073709551617) (+ .cse2 .cse1))))) (not (= (mod (+ .cse3 (* 4294967295 c_~var_1_11~0)) 4294967296) 0)) (and (or (< 1073741822 .cse4) (not (= |c_assume_abort_if_not_#in~cond| 0))) (or (< .cse4 1073741823) (not (= |c_assume_abort_if_not_#in~cond| 1)))) (< .cse2 (+ .cse4 1)) (< 2147483647 .cse4) (and (= (mod (+ c_~var_1_9~0 c_~var_1_7~0) 4294967296) 0) (<= .cse2 2147483647)))) is different from true [2023-11-29 00:16:30,104 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:16:53,558 WARN L293 SmtUtils]: Spent 12.13s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:17:05,671 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:18:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 96 proven. 307 refuted. 15 times theorem prover too weak. 981 trivial. 5 not checked. [2023-11-29 00:18:12,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904742968] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:18:12,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:18:12,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 24] total 61 [2023-11-29 00:18:12,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491233841] [2023-11-29 00:18:12,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:18:12,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-29 00:18:12,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:12,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-29 00:18:12,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=2982, Unknown=3, NotChecked=116, Total=3660 [2023-11-29 00:18:12,048 INFO L87 Difference]: Start difference. First operand 294 states and 431 transitions. Second operand has 61 states, 53 states have (on average 2.5849056603773586) internal successors, (137), 52 states have internal predecessors, (137), 21 states have call successors, (76), 7 states have call predecessors, (76), 15 states have return successors, (77), 20 states have call predecessors, (77), 21 states have call successors, (77) [2023-11-29 00:18:29,052 WARN L293 SmtUtils]: Spent 13.05s on a formula simplification. DAG size of input: 85 DAG size of output: 79 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)