./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB --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 2523ced2438443f67ce3f9b2a31659324ab8c393814038e5cf118fc2fe7fb5b1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:28:45,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:28:45,537 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 23:28:45,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:28:45,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:28:45,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:28:45,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:28:45,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:28:45,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:28:45,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:28:45,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:28:45,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:28:45,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:28:45,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:28:45,576 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:28:45,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:28:45,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:28:45,577 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:28:45,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:28:45,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:28:45,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:28:45,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:28:45,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:28:45,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:28:45,581 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:28:45,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:28:45,581 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:28:45,581 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:28:45,582 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:28:45,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:28:45,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:28:45,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:28:45,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:28:45,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:28:45,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:28:45,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:28:45,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:28:45,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:28:45,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:28:45,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:28:45,583 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:28:45,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:28:45,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:28:45,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:28:45,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:28:45,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:28:45,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:28:45,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:28:45,584 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 2523ced2438443f67ce3f9b2a31659324ab8c393814038e5cf118fc2fe7fb5b1 [2024-11-27 23:28:45,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:28:45,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:28:45,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:28:45,934 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:28:45,934 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:28:45,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i [2024-11-27 23:28:48,927 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/data/491da382a/bac17e5f0e824bb386af527030658af8/FLAG7d8f874e8 [2024-11-27 23:28:49,289 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:28:49,290 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i [2024-11-27 23:28:49,311 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/data/491da382a/bac17e5f0e824bb386af527030658af8/FLAG7d8f874e8 [2024-11-27 23:28:49,531 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/data/491da382a/bac17e5f0e824bb386af527030658af8 [2024-11-27 23:28:49,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:28:49,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:28:49,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:28:49,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:28:49,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:28:49,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:28:49" (1/1) ... [2024-11-27 23:28:49,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e46775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49, skipping insertion in model container [2024-11-27 23:28:49,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:28:49" (1/1) ... [2024-11-27 23:28:49,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:28:49,790 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i[914,927] [2024-11-27 23:28:49,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:28:49,875 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:28:49,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i[914,927] [2024-11-27 23:28:49,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:28:49,950 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:28:49,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49 WrapperNode [2024-11-27 23:28:49,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:28:49,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:28:49,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:28:49,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:28:49,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49" (1/1) ... [2024-11-27 23:28:49,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49" (1/1) ... [2024-11-27 23:28:50,039 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-27 23:28:50,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:28:50,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:28:50,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:28:50,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:28:50,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49" (1/1) ... [2024-11-27 23:28:50,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49" (1/1) ... [2024-11-27 23:28:50,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49" (1/1) ... [2024-11-27 23:28:50,072 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 23:28:50,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49" (1/1) ... [2024-11-27 23:28:50,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49" (1/1) ... [2024-11-27 23:28:50,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49" (1/1) ... [2024-11-27 23:28:50,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49" (1/1) ... [2024-11-27 23:28:50,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49" (1/1) ... [2024-11-27 23:28:50,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49" (1/1) ... [2024-11-27 23:28:50,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49" (1/1) ... [2024-11-27 23:28:50,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:28:50,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:28:50,111 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:28:50,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:28:50,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49" (1/1) ... [2024-11-27 23:28:50,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:28:50,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:28:50,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:28:50,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:28:50,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:28:50,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-27 23:28:50,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-27 23:28:50,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:28:50,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:28:50,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:28:50,311 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:28:50,316 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:28:50,837 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-27 23:28:50,837 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:28:50,856 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:28:50,857 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 23:28:50,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:28:50 BoogieIcfgContainer [2024-11-27 23:28:50,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:28:50,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:28:50,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:28:50,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:28:50,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:28:49" (1/3) ... [2024-11-27 23:28:50,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd7cca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:28:50, skipping insertion in model container [2024-11-27 23:28:50,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:28:49" (2/3) ... [2024-11-27 23:28:50,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd7cca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:28:50, skipping insertion in model container [2024-11-27 23:28:50,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:28:50" (3/3) ... [2024-11-27 23:28:50,870 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-6.i [2024-11-27 23:28:50,890 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:28:50,892 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-6.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 23:28:50,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:28:50,992 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60744aa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:28:50,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:28:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-27 23:28:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-27 23:28:51,010 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:51,011 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:51,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:28:51,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:51,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1492909268, now seen corresponding path program 1 times [2024-11-27 23:28:51,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:51,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139093458] [2024-11-27 23:28:51,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:51,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-27 23:28:51,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:28:51,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139093458] [2024-11-27 23:28:51,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139093458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:28:51,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245301274] [2024-11-27 23:28:51,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:51,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:28:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:28:51,401 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:28:51,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 23:28:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:28:51,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 23:28:51,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:28:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-27 23:28:51,659 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 23:28:51,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245301274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:28:51,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:28:51,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-27 23:28:51,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146548444] [2024-11-27 23:28:51,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:28:51,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 23:28:51,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:28:51,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 23:28:51,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:28:51,698 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-27 23:28:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:28:51,737 INFO L93 Difference]: Finished difference Result 101 states and 175 transitions. [2024-11-27 23:28:51,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 23:28:51,741 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-11-27 23:28:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:28:51,750 INFO L225 Difference]: With dead ends: 101 [2024-11-27 23:28:51,750 INFO L226 Difference]: Without dead ends: 50 [2024-11-27 23:28:51,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 23:28:51,760 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:28:51,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:28:51,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-27 23:28:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-27 23:28:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-27 23:28:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2024-11-27 23:28:51,822 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 118 [2024-11-27 23:28:51,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:28:51,823 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2024-11-27 23:28:51,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-27 23:28:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-11-27 23:28:51,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-27 23:28:51,828 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:28:51,829 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:28:51,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 23:28:52,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-27 23:28:52,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:28:52,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:28:52,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2060601006, now seen corresponding path program 1 times [2024-11-27 23:28:52,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:28:52,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637118364] [2024-11-27 23:28:52,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:28:52,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:28:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:29:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-27 23:29:33,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:29:33,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637118364] [2024-11-27 23:29:33,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637118364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:29:33,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:29:33,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-27 23:29:33,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955504087] [2024-11-27 23:29:33,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:29:33,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 23:29:33,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:29:33,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 23:29:33,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:29:33,473 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-27 23:29:37,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:29:44,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:29:50,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:29:53,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:29:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:29:58,314 INFO L93 Difference]: Finished difference Result 141 states and 198 transitions. [2024-11-27 23:29:58,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:29:58,316 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-11-27 23:29:58,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:29:58,320 INFO L225 Difference]: With dead ends: 141 [2024-11-27 23:29:58,320 INFO L226 Difference]: Without dead ends: 139 [2024-11-27 23:29:58,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-11-27 23:29:58,321 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 151 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 78 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:29:58,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 452 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 208 Invalid, 2 Unknown, 0 Unchecked, 16.2s Time] [2024-11-27 23:29:58,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-27 23:29:58,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 101. [2024-11-27 23:29:58,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 60 states have internal predecessors, (77), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-27 23:29:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2024-11-27 23:29:58,354 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 153 transitions. Word has length 118 [2024-11-27 23:29:58,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:29:58,355 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 153 transitions. [2024-11-27 23:29:58,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-27 23:29:58,355 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 153 transitions. [2024-11-27 23:29:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-27 23:29:58,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:29:58,358 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:29:58,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:29:58,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:29:58,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:29:58,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2003342704, now seen corresponding path program 1 times [2024-11-27 23:29:58,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:29:58,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490147416] [2024-11-27 23:29:58,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:29:58,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:29:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:30:31,932 WARN L286 SmtUtils]: Spent 5.40s on a formula simplification. DAG size of input: 137 DAG size of output: 125 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:30:32,056 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-27 23:30:32,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:30:32,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490147416] [2024-11-27 23:30:32,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490147416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:30:32,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:30:32,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-27 23:30:32,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922177798] [2024-11-27 23:30:32,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:30:32,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 23:30:32,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:30:32,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 23:30:32,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:30:32,059 INFO L87 Difference]: Start difference. First operand 101 states and 153 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-27 23:30:42,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:30:47,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:30:55,136 WARN L286 SmtUtils]: Spent 7.63s on a formula simplification. DAG size of input: 129 DAG size of output: 128 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:30:59,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:31:03,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:31:07,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:31:15,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:15,637 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2024-11-27 23:31:15,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 23:31:15,639 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-11-27 23:31:15,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:15,642 INFO L225 Difference]: With dead ends: 139 [2024-11-27 23:31:15,642 INFO L226 Difference]: Without dead ends: 137 [2024-11-27 23:31:15,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2024-11-27 23:31:15,644 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 139 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 98 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:15,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 469 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 308 Invalid, 2 Unknown, 0 Unchecked, 21.9s Time] [2024-11-27 23:31:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-27 23:31:15,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2024-11-27 23:31:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-27 23:31:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2024-11-27 23:31:15,694 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 158 transitions. Word has length 118 [2024-11-27 23:31:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:15,697 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 158 transitions. [2024-11-27 23:31:15,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-27 23:31:15,698 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 158 transitions. [2024-11-27 23:31:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-27 23:31:15,702 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:15,703 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:15,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 23:31:15,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:15,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:15,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1223349965, now seen corresponding path program 1 times [2024-11-27 23:31:15,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:15,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005386999] [2024-11-27 23:31:15,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:15,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-27 23:31:16,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:16,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005386999] [2024-11-27 23:31:16,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005386999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:31:16,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:31:16,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:31:16,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293228103] [2024-11-27 23:31:16,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:31:16,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:31:16,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:16,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:31:16,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:31:16,059 INFO L87 Difference]: Start difference. First operand 105 states and 158 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:31:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:16,608 INFO L93 Difference]: Finished difference Result 288 states and 432 transitions. [2024-11-27 23:31:16,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:31:16,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2024-11-27 23:31:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:16,612 INFO L225 Difference]: With dead ends: 288 [2024-11-27 23:31:16,612 INFO L226 Difference]: Without dead ends: 186 [2024-11-27 23:31:16,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-27 23:31:16,618 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 76 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:16,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 239 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 23:31:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-27 23:31:16,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 151. [2024-11-27 23:31:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-27 23:31:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 229 transitions. [2024-11-27 23:31:16,697 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 229 transitions. Word has length 119 [2024-11-27 23:31:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:16,699 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 229 transitions. [2024-11-27 23:31:16,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:31:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 229 transitions. [2024-11-27 23:31:16,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-27 23:31:16,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:16,707 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:16,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 23:31:16,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:16,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:16,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2032696591, now seen corresponding path program 1 times [2024-11-27 23:31:16,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:16,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252622973] [2024-11-27 23:31:16,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:16,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-27 23:31:40,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:40,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252622973] [2024-11-27 23:31:40,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252622973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:31:40,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:31:40,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-27 23:31:40,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629435311] [2024-11-27 23:31:40,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:31:40,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 23:31:40,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:40,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 23:31:40,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:31:40,502 INFO L87 Difference]: Start difference. First operand 151 states and 229 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:31:46,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:31:48,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:31:50,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:32:02,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:32:03,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:32:03,044 INFO L93 Difference]: Finished difference Result 219 states and 313 transitions. [2024-11-27 23:32:03,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 23:32:03,045 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2024-11-27 23:32:03,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:32:03,048 INFO L225 Difference]: With dead ends: 219 [2024-11-27 23:32:03,048 INFO L226 Difference]: Without dead ends: 217 [2024-11-27 23:32:03,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=79, Invalid=226, Unknown=1, NotChecked=0, Total=306 [2024-11-27 23:32:03,050 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 87 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:32:03,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 536 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 335 Invalid, 1 Unknown, 0 Unchecked, 14.3s Time] [2024-11-27 23:32:03,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-27 23:32:03,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 152. [2024-11-27 23:32:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 91 states have (on average 1.2857142857142858) internal successors, (117), 91 states have internal predecessors, (117), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-27 23:32:03,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2024-11-27 23:32:03,093 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 119 [2024-11-27 23:32:03,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:32:03,094 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2024-11-27 23:32:03,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:32:03,094 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2024-11-27 23:32:03,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-27 23:32:03,096 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:32:03,097 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:32:03,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 23:32:03,097 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:32:03,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:32:03,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1975438289, now seen corresponding path program 1 times [2024-11-27 23:32:03,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:32:03,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222280110] [2024-11-27 23:32:03,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:32:03,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:32:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:32:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-27 23:32:31,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:32:31,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222280110] [2024-11-27 23:32:31,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222280110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:32:31,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:32:31,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-27 23:32:31,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428913433] [2024-11-27 23:32:31,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:32:31,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 23:32:31,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:32:31,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 23:32:31,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:32:31,164 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:32:43,788 WARN L286 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 145 DAG size of output: 120 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:32:48,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:32:51,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:33:00,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:33:01,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:33:01,138 INFO L93 Difference]: Finished difference Result 219 states and 313 transitions. [2024-11-27 23:33:01,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 23:33:01,139 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2024-11-27 23:33:01,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:33:01,141 INFO L225 Difference]: With dead ends: 219 [2024-11-27 23:33:01,142 INFO L226 Difference]: Without dead ends: 217 [2024-11-27 23:33:01,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2024-11-27 23:33:01,146 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 107 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:33:01,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 531 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 292 Invalid, 1 Unknown, 0 Unchecked, 12.2s Time] [2024-11-27 23:33:01,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-27 23:33:01,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 150. [2024-11-27 23:33:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 57 states have call successors, (57), 3 states have call predecessors, (57), 3 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-27 23:33:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2024-11-27 23:33:01,204 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 119 [2024-11-27 23:33:01,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:33:01,206 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2024-11-27 23:33:01,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:33:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2024-11-27 23:33:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-27 23:33:01,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:33:01,209 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:33:01,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 23:33:01,209 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:33:01,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:33:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1634763599, now seen corresponding path program 1 times [2024-11-27 23:33:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:33:01,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72833533] [2024-11-27 23:33:01,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:33:01,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:33:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:33:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-27 23:33:01,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:33:01,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72833533] [2024-11-27 23:33:01,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72833533] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:33:01,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654117359] [2024-11-27 23:33:01,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:33:01,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:33:01,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:33:01,580 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:33:01,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 23:33:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:33:01,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-27 23:33:01,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:33:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-11-27 23:33:02,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:33:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-27 23:33:03,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654117359] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:33:03,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:33:03,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2024-11-27 23:33:03,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473386317] [2024-11-27 23:33:03,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:33:03,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 23:33:03,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:33:03,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 23:33:03,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-27 23:33:03,396 INFO L87 Difference]: Start difference. First operand 150 states and 227 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2024-11-27 23:33:05,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:33:05,439 INFO L93 Difference]: Finished difference Result 593 states and 865 transitions. [2024-11-27 23:33:05,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-27 23:33:05,440 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) Word has length 119 [2024-11-27 23:33:05,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:33:05,443 INFO L225 Difference]: With dead ends: 593 [2024-11-27 23:33:05,443 INFO L226 Difference]: Without dead ends: 446 [2024-11-27 23:33:05,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2024-11-27 23:33:05,445 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 167 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-27 23:33:05,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 215 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-27 23:33:05,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-27 23:33:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 294. [2024-11-27 23:33:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 170 states have (on average 1.2117647058823529) internal successors, (206), 170 states have internal predecessors, (206), 114 states have call successors, (114), 9 states have call predecessors, (114), 9 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-27 23:33:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 434 transitions. [2024-11-27 23:33:05,562 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 434 transitions. Word has length 119 [2024-11-27 23:33:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:33:05,562 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 434 transitions. [2024-11-27 23:33:05,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2024-11-27 23:33:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 434 transitions. [2024-11-27 23:33:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-27 23:33:05,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:33:05,565 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:33:05,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 23:33:05,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:33:05,766 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:33:05,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:33:05,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1795166832, now seen corresponding path program 1 times [2024-11-27 23:33:05,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:33:05,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167578696] [2024-11-27 23:33:05,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:33:05,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:33:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-27 23:33:05,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1033586158] [2024-11-27 23:33:05,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:33:05,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:33:05,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:33:05,867 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:33:05,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 23:33:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:33:06,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-27 23:33:06,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:33:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-11-27 23:33:07,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:33:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-27 23:33:13,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:33:13,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167578696] [2024-11-27 23:33:13,387 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-27 23:33:13,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033586158] [2024-11-27 23:33:13,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033586158] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-27 23:33:13,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 23:33:13,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2024-11-27 23:33:13,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685486396] [2024-11-27 23:33:13,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:33:13,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 23:33:13,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:33:13,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 23:33:13,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-27 23:33:13,390 INFO L87 Difference]: Start difference. First operand 294 states and 434 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-27 23:33:17,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:33:17,487 INFO L93 Difference]: Finished difference Result 550 states and 800 transitions. [2024-11-27 23:33:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 23:33:17,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2024-11-27 23:33:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:33:17,491 INFO L225 Difference]: With dead ends: 550 [2024-11-27 23:33:17,491 INFO L226 Difference]: Without dead ends: 299 [2024-11-27 23:33:17,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2024-11-27 23:33:17,494 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 81 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:33:17,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 357 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-27 23:33:17,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-27 23:33:17,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 251. [2024-11-27 23:33:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 147 states have (on average 1.2040816326530612) internal successors, (177), 147 states have internal predecessors, (177), 95 states have call successors, (95), 8 states have call predecessors, (95), 8 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2024-11-27 23:33:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 367 transitions. [2024-11-27 23:33:17,576 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 367 transitions. Word has length 120 [2024-11-27 23:33:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:33:17,577 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 367 transitions. [2024-11-27 23:33:17,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-27 23:33:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 367 transitions. [2024-11-27 23:33:17,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-27 23:33:17,582 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:33:17,582 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:33:17,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 23:33:17,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-27 23:33:17,783 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:33:17,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:33:17,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1254402368, now seen corresponding path program 1 times [2024-11-27 23:33:17,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:33:17,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720199034] [2024-11-27 23:33:17,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:33:17,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:33:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:33:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-11-27 23:33:27,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:33:27,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720199034] [2024-11-27 23:33:27,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720199034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:33:27,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:33:27,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 23:33:27,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210573048] [2024-11-27 23:33:27,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:33:27,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 23:33:27,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:33:27,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 23:33:27,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:33:27,217 INFO L87 Difference]: Start difference. First operand 251 states and 367 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:33:32,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:33:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:33:37,573 INFO L93 Difference]: Finished difference Result 314 states and 449 transitions. [2024-11-27 23:33:37,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:33:37,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 233 [2024-11-27 23:33:37,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:33:37,578 INFO L225 Difference]: With dead ends: 314 [2024-11-27 23:33:37,578 INFO L226 Difference]: Without dead ends: 312 [2024-11-27 23:33:37,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:33:37,580 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 47 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:33:37,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 345 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2024-11-27 23:33:37,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-27 23:33:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 255. [2024-11-27 23:33:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 151 states have (on average 1.218543046357616) internal successors, (184), 151 states have internal predecessors, (184), 95 states have call successors, (95), 8 states have call predecessors, (95), 8 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2024-11-27 23:33:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 374 transitions. [2024-11-27 23:33:37,663 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 374 transitions. Word has length 233 [2024-11-27 23:33:37,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:33:37,664 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 374 transitions. [2024-11-27 23:33:37,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:33:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 374 transitions. [2024-11-27 23:33:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-27 23:33:37,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:33:37,669 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:33:37,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 23:33:37,670 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:33:37,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:33:37,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1197144066, now seen corresponding path program 1 times [2024-11-27 23:33:37,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:33:37,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526710353] [2024-11-27 23:33:37,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:33:37,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:33:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:07,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-11-27 23:34:07,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:07,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526710353] [2024-11-27 23:34:07,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526710353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:07,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:07,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 23:34:07,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522767435] [2024-11-27 23:34:07,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:07,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 23:34:07,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:07,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 23:34:07,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:34:07,060 INFO L87 Difference]: Start difference. First operand 255 states and 374 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:34:11,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:34:15,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:34:21,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:34:21,099 INFO L93 Difference]: Finished difference Result 300 states and 432 transitions. [2024-11-27 23:34:21,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:34:21,100 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 233 [2024-11-27 23:34:21,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:34:21,103 INFO L225 Difference]: With dead ends: 300 [2024-11-27 23:34:21,103 INFO L226 Difference]: Without dead ends: 298 [2024-11-27 23:34:21,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:34:21,104 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 31 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-27 23:34:21,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 330 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2024-11-27 23:34:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-27 23:34:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 151. [2024-11-27 23:34:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 88 states have internal predecessors, (105), 57 states have call successors, (57), 5 states have call predecessors, (57), 5 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-27 23:34:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2024-11-27 23:34:21,183 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 233 [2024-11-27 23:34:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:34:21,184 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2024-11-27 23:34:21,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:34:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2024-11-27 23:34:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-27 23:34:21,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:34:21,189 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:34:21,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 23:34:21,189 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:34:21,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:34:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2000995963, now seen corresponding path program 1 times [2024-11-27 23:34:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:34:21,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317249940] [2024-11-27 23:34:21,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:34:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:34:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:34:33,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-11-27 23:34:33,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:34:33,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317249940] [2024-11-27 23:34:33,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317249940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:34:33,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:34:33,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 23:34:33,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121851426] [2024-11-27 23:34:33,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:34:33,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 23:34:33,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:34:33,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 23:34:33,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:34:33,779 INFO L87 Difference]: Start difference. First operand 151 states and 219 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:34:36,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:34:45,655 WARN L286 SmtUtils]: Spent 7.20s on a formula simplification that was a NOOP. DAG size: 101 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:34:49,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:34:54,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:35:01,240 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:35:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:35:04,527 INFO L93 Difference]: Finished difference Result 170 states and 243 transitions. [2024-11-27 23:35:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:35:04,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 234 [2024-11-27 23:35:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:35:04,530 INFO L225 Difference]: With dead ends: 170 [2024-11-27 23:35:04,530 INFO L226 Difference]: Without dead ends: 168 [2024-11-27 23:35:04,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-27 23:35:04,531 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 24 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-11-27 23:35:04,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 453 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 1 Unknown, 0 Unchecked, 11.6s Time] [2024-11-27 23:35:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-27 23:35:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2024-11-27 23:35:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 88 states have internal predecessors, (105), 57 states have call successors, (57), 5 states have call predecessors, (57), 5 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-27 23:35:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2024-11-27 23:35:04,594 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 234 [2024-11-27 23:35:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:35:04,595 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2024-11-27 23:35:04,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:35:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2024-11-27 23:35:04,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-27 23:35:04,600 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:35:04,600 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:35:04,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 23:35:04,601 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:35:04,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:35:04,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1943737661, now seen corresponding path program 1 times [2024-11-27 23:35:04,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:35:04,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667612417] [2024-11-27 23:35:04,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:04,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:35:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:16,953 WARN L286 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:35:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-11-27 23:35:21,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:35:21,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667612417] [2024-11-27 23:35:21,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667612417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:35:21,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759717081] [2024-11-27 23:35:21,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:35:21,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:35:21,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:35:21,142 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:35:21,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 23:35:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:35:21,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-27 23:35:21,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:36:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 1161 proven. 138 refuted. 0 times theorem prover too weak. 1551 trivial. 0 not checked. [2024-11-27 23:36:09,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:38:04,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse36 (mod c_~last_1_var_1_6~0 65536))) (let ((.cse37 (mod c_~var_1_6~0 65536)) (.cse23 (mod c_~last_1_var_1_18~0 4294967296)) (.cse16 (mod c_~var_1_4~0 65536)) (.cse10 (= c_~last_1_var_1_18~0 .cse36)) (.cse33 (mod c_~var_1_1~0 4294967296))) (let ((.cse1 (= .cse33 128)) (.cse9 (= 1000000000 .cse33)) (.cse20 (+ c_~last_1_var_1_18~0 1)) (.cse14 (not .cse10)) (.cse38 (mod (div .cse36 .cse16) 4294967296)) (.cse17 (+ .cse23 1)) (.cse31 (mod (+ (* .cse37 c_~var_1_7~0) (* .cse37 .cse37)) 4294967296)) (.cse21 (mod c_~var_1_12~0 256))) (let ((.cse0 (= .cse21 1)) (.cse4 (<= .cse31 .cse33)) (.cse11 (<= .cse31 1000000000)) (.cse34 (< .cse38 .cse17)) (.cse19 (or (< .cse38 .cse20) .cse14)) (.cse13 (<= .cse31 128)) (.cse6 (= (mod c_~var_1_13~0 256) 0)) (.cse3 (= .cse37 (mod c_~var_1_11~0 65536))) (.cse18 (and .cse9 .cse10)) (.cse12 (not .cse1)) (.cse15 (+ .cse36 1)) (.cse22 (mod c_~var_1_17~0 256))) (and (or .cse0 (let ((.cse24 (= .cse21 0)) (.cse5 (or .cse18 .cse34))) (and (or (let ((.cse8 (forall ((v_z_30 Int)) (or (< 4294967295 v_z_30) (< (mod (div v_z_30 .cse16) 4294967296) .cse17) (< v_z_30 .cse15)))) (.cse7 (forall ((v_z_30 Int)) (or (< 4294967295 v_z_30) (< .cse23 (mod (div v_z_30 .cse16) 4294967296)) (< v_z_30 .cse15)))) (.cse2 (= .cse21 .cse22))) (and (or .cse1 (and .cse2 .cse3 .cse4 .cse5)) (or .cse1 (and .cse6 (or (and .cse2 .cse3 .cse4) .cse7) (or .cse8 (and .cse9 .cse2 .cse10 .cse3 .cse11)))) (or .cse12 (and .cse6 (or .cse8 (and .cse13 .cse2 .cse3 .cse14)) (or (and .cse13 .cse2 .cse3) .cse7))) (or .cse1 (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (< v_z_32 .cse15) (< (mod (div v_z_32 .cse16) 4294967296) .cse17))) .cse18) (or .cse12 (and .cse19 .cse13 .cse2 .cse3)) (or .cse12 (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (< v_z_32 .cse15) (< (mod (div v_z_32 .cse16) 4294967296) .cse20))) .cse14))) .cse24) (or (not .cse24) (let ((.cse30 (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< .cse23 (mod (div v_z_33 .cse16) 4294967296)) (< v_z_33 .cse15)))) (.cse29 (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< v_z_33 .cse15) (< (mod (div v_z_33 .cse16) 4294967296) .cse17)))) (.cse28 (mod (+ .cse16 (* c_~var_1_1~0 4294967295)) 4294967296)) (.cse32 (not .cse9)) (.cse25 (= .cse22 0)) (.cse27 (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse15) (< (mod (div v_z_34 .cse16) 4294967296) .cse17))))) (and (or .cse1 (and .cse3 .cse5)) (or .cse12 (and .cse19 .cse13 .cse3 .cse25)) (or .cse12 (let ((.cse26 (or (= .cse28 128) .cse3))) (and (or (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse15) (< .cse23 (mod (div v_z_34 .cse16) 4294967296)))) (and .cse13 .cse25 .cse26)) (or .cse27 (and .cse13 .cse25 .cse14 .cse26))))) (or .cse12 (and (or .cse29 (and .cse13 .cse3 .cse25 .cse14)) .cse6 (or .cse30 (and .cse13 .cse3 .cse25)))) (or (and (or (and (or (< .cse31 1000000001) .cse32) .cse3 .cse4 .cse25) .cse30) .cse6 (or .cse29 (and .cse9 .cse10 .cse3 .cse25 .cse11))) .cse1) (or .cse1 (and (or .cse3 (= .cse28 .cse33)) (or (and .cse3 .cse11) .cse32) .cse4 .cse25 (or .cse27 (and .cse9 .cse10 .cse3 .cse11)))))))))) (or (not .cse0) (let ((.cse35 (= .cse22 1))) (and (or .cse1 (and .cse35 .cse6 .cse3 .cse4 (or (and .cse9 .cse10 .cse11) .cse34))) (or .cse12 (and .cse19 .cse13 .cse35 .cse6 .cse3)) (or .cse12 .cse14 (forall ((v_z_29 Int)) (or (< (mod (div v_z_29 .cse16) 4294967296) .cse20) (< v_z_29 .cse15) (< 4294967295 v_z_29)))) (or .cse1 (forall ((v_z_28 Int)) (or (< (mod (div v_z_28 .cse16) 4294967296) .cse17) (< v_z_28 .cse15) (< 4294967295 v_z_28))) .cse18) (or .cse1 (forall ((v_z_29 Int)) (or (< v_z_29 .cse15) (< (mod (div v_z_29 .cse16) 4294967296) .cse17) (< 4294967295 v_z_29))) .cse18) (or .cse12 (forall ((v_z_28 Int)) (or (< (mod (div v_z_28 .cse16) 4294967296) .cse20) (< v_z_28 .cse15) (< 4294967295 v_z_28))) .cse14))))))))) is different from false [2024-11-27 23:39:54,211 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse61 (mod c_~var_1_11~0 65536)) (.cse28 (mod c_~last_1_var_1_6~0 65536)) (.cse7 (mod c_~var_1_1~0 4294967296))) (let ((.cse0 (= .cse7 128)) (.cse63 (= c_~last_1_var_1_18~0 .cse28)) (.cse62 (* .cse61 .cse61))) (let ((.cse8 (+ .cse7 4294967296)) (.cse5 (+ (mod c_~last_1_var_1_18~0 4294967296) 1)) (.cse1 (forall ((~var_1_7~0 Int)) (< .cse7 (mod (+ (* .cse61 ~var_1_7~0) .cse62) 4294967296)))) (.cse2 (and (= 1000000000 .cse7) .cse63)) (.cse9 (mod (* c_~var_1_1~0 4294967295) 4294967296)) (.cse3 (+ .cse28 1)) (.cse16 (+ c_~last_1_var_1_18~0 1)) (.cse14 (not .cse0)) (.cse17 (not .cse63)) (.cse18 (forall ((~var_1_7~0 Int)) (< 128 (mod (+ (* .cse61 ~var_1_7~0) .cse62) 4294967296))))) (and (or .cse0 .cse1 .cse2 (and (forall ((v_z_30 Int)) (or (< 4294967295 v_z_30) (< v_z_30 .cse3) (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse6 (+ .cse9 v_z_78)) (.cse4 (+ v_z_78 (* v_y_78 4294967296)))) (or (< (mod (div v_z_30 .cse4) 4294967296) .cse5) (= .cse6 .cse7) (< .cse4 0) (= .cse6 .cse8) (< 4294967295 v_z_78) (< 65535 .cse4) (< v_z_78 0)))))) (forall ((v_z_30 Int)) (or (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse10 (+ .cse9 v_z_78)) (.cse11 (+ v_z_78 (* v_y_78 4294967296)))) (or (< .cse10 4294967296) (= .cse10 .cse8) (< 4294967295 v_z_78) (< 65535 .cse11) (< (div v_z_30 .cse11) .cse5)))) (< 4294967295 v_z_30) (< v_z_30 .cse3))) (forall ((v_z_30 Int)) (or (< 4294967295 v_z_30) (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse13 (+ .cse9 v_z_78)) (.cse12 (+ v_z_78 (* v_y_78 4294967296)))) (or (< (mod (div v_z_30 .cse12) 4294967296) .cse5) (= .cse13 .cse7) (< .cse12 0) (< 4294967295 .cse13) (< 65535 .cse12) (< v_z_78 0)))) (< v_z_30 .cse3))))) (or .cse14 (forall ((v_z_63 Int) (v_y_63 Int) (v_z_33 Int)) (let ((.cse15 (+ (* v_y_63 4294967296) v_z_63))) (or (< 4294967295 v_z_33) (< (mod (div v_z_33 .cse15) 4294967296) .cse16) (< v_z_33 .cse3) (= 4294967424 (+ .cse9 v_z_63)) (< v_z_63 0) (< .cse15 0) (< 65535 .cse15) (< 4294967295 v_z_63)))) .cse17 .cse18) (or (forall ((v_y_57 Int) (v_z_57 Int) (v_z_34 Int)) (let ((.cse19 (+ (* v_y_57 4294967296) v_z_57))) (or (< 4294967295 v_z_34) (< (mod (div v_z_34 .cse19) 4294967296) .cse16) (< v_z_34 .cse3) (< 65535 .cse19) (< 4294967295 v_z_57) (< .cse19 0) (= 4294967424 (+ .cse9 v_z_57)) (< v_z_57 0)))) .cse14 .cse17 .cse18) (or .cse0 .cse1 .cse2 (and (forall ((v_z_34 Int)) (or (forall ((v_z_72 Int) (v_y_72 Int)) (let ((.cse21 (+ (* v_y_72 4294967296) v_z_72)) (.cse20 (+ .cse9 v_z_72))) (or (< .cse20 4294967296) (< 4294967295 v_z_72) (< (div v_z_34 .cse21) .cse5) (< 65535 .cse21) (= .cse20 .cse8)))) (< 4294967295 v_z_34) (< v_z_34 .cse3))) (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse3) (forall ((v_z_72 Int) (v_y_72 Int)) (let ((.cse23 (+ (* v_y_72 4294967296) v_z_72)) (.cse22 (+ .cse9 v_z_72))) (or (< v_z_72 0) (< 4294967295 .cse22) (< (mod (div v_z_34 .cse23) 4294967296) .cse5) (< 65535 .cse23) (< .cse23 0) (= .cse22 .cse7)))))) (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse3) (forall ((v_z_72 Int) (v_y_72 Int)) (let ((.cse24 (+ (* v_y_72 4294967296) v_z_72)) (.cse25 (+ .cse9 v_z_72))) (or (< v_z_72 0) (< (mod (div v_z_34 .cse24) 4294967296) .cse5) (< 4294967295 v_z_72) (< 65535 .cse24) (= .cse25 .cse8) (< .cse24 0) (= .cse25 .cse7)))))))) (or .cse0 .cse1 .cse2 (and (forall ((v_z_81 Int) (v_y_81 Int)) (let ((.cse27 (+ v_z_81 (* v_y_81 4294967296))) (.cse26 (+ .cse9 v_z_81))) (or (< 4294967295 .cse26) (< v_z_81 0) (< .cse27 0) (< (mod (div .cse28 .cse27) 4294967296) .cse5) (= .cse26 .cse7)))) (forall ((v_z_81 Int) (v_y_81 Int)) (let ((.cse30 (+ v_z_81 (* v_y_81 4294967296))) (.cse29 (+ .cse9 v_z_81))) (or (< v_z_81 0) (< 4294967295 v_z_81) (= .cse29 .cse8) (< .cse30 0) (< (mod (div .cse28 .cse30) 4294967296) .cse5) (= .cse29 .cse7)))) (forall ((v_z_81 Int) (v_y_81 Int)) (let ((.cse31 (+ .cse9 v_z_81))) (or (< (div .cse28 (+ v_z_81 (* v_y_81 4294967296))) .cse5) (< 4294967295 v_z_81) (= .cse31 .cse8) (< .cse31 4294967296)))))) (or (forall ((v_z_69 Int) (v_y_69 Int) (v_z_28 Int)) (let ((.cse32 (+ (* v_y_69 4294967296) v_z_69))) (or (< .cse32 0) (< (mod (div v_z_28 .cse32) 4294967296) .cse16) (< 65535 .cse32) (< v_z_28 .cse3) (= 4294967424 (+ .cse9 v_z_69)) (< v_z_69 0) (< 4294967295 v_z_69) (< 4294967295 v_z_28)))) .cse14 .cse17 .cse18) (or .cse0 .cse1 .cse2 (and (forall ((v_z_29 Int)) (or (< v_z_29 .cse3) (forall ((v_z_75 Int) (v_y_75 Int)) (let ((.cse33 (+ .cse9 v_z_75)) (.cse34 (+ v_z_75 (* v_y_75 4294967296)))) (or (< 4294967295 v_z_75) (= .cse33 .cse8) (< (div v_z_29 .cse34) .cse5) (< .cse33 4294967296) (< 65535 .cse34)))) (< 4294967295 v_z_29))) (forall ((v_z_29 Int)) (or (< v_z_29 .cse3) (forall ((v_z_75 Int) (v_y_75 Int)) (let ((.cse35 (+ v_z_75 (* v_y_75 4294967296))) (.cse36 (+ .cse9 v_z_75))) (or (< v_z_75 0) (< 65535 .cse35) (= .cse7 .cse36) (< .cse35 0) (< (mod (div v_z_29 .cse35) 4294967296) .cse5) (< 4294967295 .cse36)))) (< 4294967295 v_z_29))) (forall ((v_z_29 Int)) (or (forall ((v_z_75 Int) (v_y_75 Int)) (let ((.cse37 (+ .cse9 v_z_75)) (.cse38 (+ v_z_75 (* v_y_75 4294967296)))) (or (< 4294967295 v_z_75) (= .cse37 .cse8) (< v_z_75 0) (< 65535 .cse38) (= .cse7 .cse37) (< .cse38 0) (< (mod (div v_z_29 .cse38) 4294967296) .cse5)))) (< v_z_29 .cse3) (< 4294967295 v_z_29))))) (or .cse14 .cse17 (forall ((v_z_48 Int) (v_y_48 Int)) (let ((.cse39 (+ v_z_48 (* v_y_48 4294967296)))) (or (< v_z_48 0) (< .cse39 0) (< 4294967295 v_z_48) (< (mod (div .cse28 .cse39) 4294967296) .cse16)))) .cse18) (or (forall ((v_z_30 Int) (v_z_66 Int) (v_y_66 Int)) (let ((.cse40 (+ v_z_66 (* v_y_66 4294967296)))) (or (< (mod (div v_z_30 .cse40) 4294967296) .cse16) (< v_z_66 0) (< 4294967295 v_z_30) (= 4294967424 (+ .cse9 v_z_66)) (< 65535 .cse40) (< 4294967295 v_z_66) (< .cse40 0) (< v_z_30 .cse3)))) .cse14 .cse17 .cse18) (or .cse14 (forall ((v_z_29 Int) (v_z_42 Int) (v_y_42 Int)) (let ((.cse41 (+ v_z_42 (* v_y_42 4294967296)))) (or (< .cse41 0) (< 4294967295 v_z_42) (= 4294967424 (+ .cse9 v_z_42)) (< v_z_29 .cse3) (< v_z_42 0) (< (mod (div v_z_29 .cse41) 4294967296) .cse16) (< 65535 .cse41) (< 4294967295 v_z_29)))) .cse17 .cse18) (or .cse0 .cse1 .cse2 (and (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (forall ((v_z_51 Int) (v_y_51 Int)) (let ((.cse42 (+ .cse9 v_z_51)) (.cse43 (+ v_z_51 (* v_y_51 4294967296)))) (or (= .cse7 .cse42) (= .cse42 .cse8) (< .cse43 0) (< (mod (div v_z_32 .cse43) 4294967296) .cse5) (< v_z_51 0) (< 4294967295 v_z_51) (< 65535 .cse43)))) (< v_z_32 .cse3))) (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (forall ((v_z_51 Int) (v_y_51 Int)) (let ((.cse44 (+ .cse9 v_z_51)) (.cse45 (+ v_z_51 (* v_y_51 4294967296)))) (or (= .cse7 .cse44) (< .cse45 0) (< (mod (div v_z_32 .cse45) 4294967296) .cse5) (< 4294967295 .cse44) (< v_z_51 0) (< 65535 .cse45)))) (< v_z_32 .cse3))) (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (< v_z_32 .cse3) (forall ((v_z_51 Int) (v_y_51 Int)) (let ((.cse46 (+ .cse9 v_z_51)) (.cse47 (+ v_z_51 (* v_y_51 4294967296)))) (or (= .cse46 .cse8) (< (div v_z_32 .cse47) .cse5) (< .cse46 4294967296) (< 4294967295 v_z_51) (< 65535 .cse47)))))))) (or .cse0 .cse1 (and (forall ((v_z_28 Int)) (or (< v_z_28 .cse3) (forall ((v_z_60 Int) (v_y_60 Int)) (let ((.cse48 (+ v_z_60 (* v_y_60 4294967296))) (.cse49 (+ .cse9 v_z_60))) (or (< .cse48 0) (= .cse49 .cse7) (< 65535 .cse48) (< v_z_60 0) (< (mod (div v_z_28 .cse48) 4294967296) .cse5) (< 4294967295 .cse49)))) (< 4294967295 v_z_28))) (forall ((v_z_28 Int)) (or (forall ((v_z_60 Int) (v_y_60 Int)) (let ((.cse50 (+ v_z_60 (* v_y_60 4294967296))) (.cse51 (+ .cse9 v_z_60))) (or (< .cse50 0) (= .cse51 .cse7) (< 4294967295 v_z_60) (< 65535 .cse50) (< v_z_60 0) (< (mod (div v_z_28 .cse50) 4294967296) .cse5) (= .cse51 .cse8)))) (< v_z_28 .cse3) (< 4294967295 v_z_28))) (forall ((v_z_28 Int)) (or (< v_z_28 .cse3) (forall ((v_z_60 Int) (v_y_60 Int)) (let ((.cse52 (+ v_z_60 (* v_y_60 4294967296))) (.cse53 (+ .cse9 v_z_60))) (or (< 4294967295 v_z_60) (< 65535 .cse52) (< (div v_z_28 .cse52) .cse5) (< .cse53 4294967296) (= .cse53 .cse8)))) (< 4294967295 v_z_28)))) .cse2) (or .cse0 (and (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< v_z_33 .cse3) (forall ((v_z_54 Int) (v_y_54 Int)) (let ((.cse54 (+ v_z_54 (* v_y_54 4294967296))) (.cse55 (+ .cse9 v_z_54))) (or (< 65535 .cse54) (< 4294967295 v_z_54) (< .cse55 4294967296) (< (div v_z_33 .cse54) .cse5) (= .cse55 .cse8)))))) (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< v_z_33 .cse3) (forall ((v_z_54 Int) (v_y_54 Int)) (let ((.cse56 (+ v_z_54 (* v_y_54 4294967296))) (.cse57 (+ .cse9 v_z_54))) (or (< 65535 .cse56) (< 4294967295 v_z_54) (< (mod (div v_z_33 .cse56) 4294967296) .cse5) (< .cse56 0) (< v_z_54 0) (= .cse57 .cse7) (= .cse57 .cse8)))))) (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< v_z_33 .cse3) (forall ((v_z_54 Int) (v_y_54 Int)) (let ((.cse58 (+ v_z_54 (* v_y_54 4294967296))) (.cse59 (+ .cse9 v_z_54))) (or (< 65535 .cse58) (< (mod (div v_z_33 .cse58) 4294967296) .cse5) (< .cse58 0) (< v_z_54 0) (= .cse59 .cse7) (< 4294967295 .cse59))))))) .cse1 .cse2) (or (forall ((v_y_45 Int) (v_z_32 Int) (v_z_45 Int)) (let ((.cse60 (+ v_z_45 (* v_y_45 4294967296)))) (or (< v_z_45 0) (< 4294967295 v_z_32) (= 4294967424 (+ .cse9 v_z_45)) (< 4294967295 v_z_45) (< v_z_32 .cse3) (< (mod (div v_z_32 .cse60) 4294967296) .cse16) (< .cse60 0) (< 65535 .cse60)))) .cse14 .cse17 .cse18))))) is different from false [2024-11-27 23:40:03,072 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (mod c_~last_1_var_1_6~0 65536))) (let ((.cse0 (forall ((~var_1_7~0 Int)) (< 1000000000 (mod (let ((.cse18 (mod c_~var_1_11~0 65536))) (+ (* .cse18 ~var_1_7~0) (* .cse18 .cse18))) 4294967296)))) (.cse1 (= .cse14 |c_ULTIMATE.start_step_~stepLocal_1~0#1|)) (.cse4 (+ .cse14 1)) (.cse3 (+ (mod |c_ULTIMATE.start_step_~stepLocal_1~0#1| 4294967296) 1))) (and (or .cse0 .cse1 (and (forall ((v_z_28 Int)) (or (forall ((v_z_60 Int) (v_y_60 Int)) (let ((.cse2 (+ v_z_60 (* v_y_60 4294967296)))) (or (< .cse2 0) (< 999999999 v_z_60) (< 65535 .cse2) (< v_z_60 0) (< (mod (div v_z_28 .cse2) 4294967296) .cse3)))) (< v_z_28 .cse4) (< 4294967295 v_z_28))) (forall ((v_z_28 Int)) (or (forall ((v_z_60 Int) (v_y_60 Int)) (let ((.cse5 (+ v_z_60 (* v_y_60 4294967296)))) (or (< .cse5 0) (< 4294967295 v_z_60) (< 65535 .cse5) (< v_z_60 0) (< (mod (div v_z_28 .cse5) 4294967296) .cse3)))) (< v_z_28 .cse4) (< 4294967295 v_z_28))))) (or .cse0 .cse1 (and (forall ((v_z_29 Int)) (or (forall ((v_z_75 Int) (v_y_75 Int)) (let ((.cse6 (+ v_z_75 (* v_y_75 4294967296)))) (or (< 4294967295 v_z_75) (< (mod (div v_z_29 .cse6) 4294967296) .cse3) (< v_z_75 0) (< 65535 .cse6) (< .cse6 0)))) (< v_z_29 .cse4) (< 4294967295 v_z_29))) (forall ((v_z_29 Int)) (or (forall ((v_z_75 Int) (v_y_75 Int)) (let ((.cse7 (+ v_z_75 (* v_y_75 4294967296)))) (or (< (mod (div v_z_29 .cse7) 4294967296) .cse3) (< 999999999 v_z_75) (< v_z_75 0) (< 65535 .cse7) (< .cse7 0)))) (< v_z_29 .cse4) (< 4294967295 v_z_29))))) (or .cse0 .cse1 (and (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< v_z_33 .cse4) (forall ((v_z_54 Int) (v_y_54 Int)) (let ((.cse8 (+ v_z_54 (* v_y_54 4294967296)))) (or (< 65535 .cse8) (< 4294967295 v_z_54) (< .cse8 0) (< (mod (div v_z_33 .cse8) 4294967296) .cse3) (< v_z_54 0)))))) (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< v_z_33 .cse4) (forall ((v_z_54 Int) (v_y_54 Int)) (let ((.cse9 (+ v_z_54 (* v_y_54 4294967296)))) (or (< 65535 .cse9) (< 999999999 v_z_54) (< .cse9 0) (< (mod (div v_z_33 .cse9) 4294967296) .cse3) (< v_z_54 0)))))))) (or .cse0 .cse1 (and (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse4) (forall ((v_z_72 Int) (v_y_72 Int)) (let ((.cse10 (+ (* v_y_72 4294967296) v_z_72))) (or (< v_z_72 0) (< (mod (div v_z_34 .cse10) 4294967296) .cse3) (< 65535 .cse10) (< .cse10 0) (< 999999999 v_z_72)))))) (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse4) (forall ((v_z_72 Int) (v_y_72 Int)) (let ((.cse11 (+ (* v_y_72 4294967296) v_z_72))) (or (< v_z_72 0) (< (mod (div v_z_34 .cse11) 4294967296) .cse3) (< 4294967295 v_z_72) (< 65535 .cse11) (< .cse11 0)))))))) (or .cse0 .cse1 (and (forall ((v_z_30 Int)) (or (< 4294967295 v_z_30) (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse12 (+ v_z_78 (* v_y_78 4294967296)))) (or (< (mod (div v_z_30 .cse12) 4294967296) .cse3) (< .cse12 0) (< 4294967295 v_z_78) (< 65535 .cse12) (< v_z_78 0)))) (< v_z_30 .cse4))) (forall ((v_z_30 Int)) (or (< 4294967295 v_z_30) (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse13 (+ v_z_78 (* v_y_78 4294967296)))) (or (< 999999999 v_z_78) (< (mod (div v_z_30 .cse13) 4294967296) .cse3) (< .cse13 0) (< 65535 .cse13) (< v_z_78 0)))) (< v_z_30 .cse4))))) (or .cse0 .cse1 (and (forall ((v_z_81 Int) (v_y_81 Int)) (let ((.cse15 (+ v_z_81 (* v_y_81 4294967296)))) (or (< (mod (div .cse14 .cse15) 4294967296) .cse3) (< v_z_81 0) (< 4294967295 v_z_81) (< .cse15 0)))) (forall ((v_z_81 Int) (v_y_81 Int)) (or (< (mod (div .cse14 (+ v_z_81 (* v_y_81 4294967296))) 4294967296) .cse3) (< 999999999 v_z_81) (< v_z_81 0))))) (or .cse0 .cse1 (and (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (< v_z_32 .cse4) (forall ((v_z_51 Int) (v_y_51 Int)) (let ((.cse16 (+ v_z_51 (* v_y_51 4294967296)))) (or (< .cse16 0) (< v_z_51 0) (< 999999999 v_z_51) (< 65535 .cse16) (< (mod (div v_z_32 .cse16) 4294967296) .cse3)))))) (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (< v_z_32 .cse4) (forall ((v_z_51 Int) (v_y_51 Int)) (let ((.cse17 (+ v_z_51 (* v_y_51 4294967296)))) (or (< .cse17 0) (< v_z_51 0) (< 4294967295 v_z_51) (< 65535 .cse17) (< (mod (div v_z_32 .cse17) 4294967296) .cse3))))))))))) is different from false [2024-11-27 23:40:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-11-27 23:40:07,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759717081] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-27 23:40:07,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-27 23:40:07,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 12] total 25 [2024-11-27 23:40:07,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261639174] [2024-11-27 23:40:07,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:40:07,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 23:40:07,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:40:07,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 23:40:07,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=372, Unknown=15, NotChecked=126, Total=600 [2024-11-27 23:40:07,485 INFO L87 Difference]: Start difference. First operand 151 states and 219 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:40:13,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-27 23:40:18,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.71s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-27 23:40:22,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-27 23:40:27,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-27 23:40:31,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-27 23:40:35,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse25 (mod c_~last_1_var_1_18~0 4294967296)) (.cse44 (mod c_~last_1_var_1_6~0 65536)) (.cse1 (mod c_~var_1_4~0 65536)) (.cse35 (mod c_~var_1_1~0 4294967296))) (let ((.cse19 (= 1000000000 .cse35)) (.cse43 (mod (div .cse44 .cse1) 4294967296)) (.cse41 (+ .cse25 1)) (.cse42 (mod c_~var_1_6~0 65536)) (.cse20 (= c_~last_1_var_1_18~0 .cse44)) (.cse9 (= .cse35 128))) (let ((.cse3 (not .cse9)) (.cse2 (+ c_~last_1_var_1_18~0 1)) (.cse4 (not .cse20)) (.cse33 (mod (+ (* .cse42 c_~var_1_7~0) (* .cse42 .cse42)) 4294967296)) (.cse23 (mod c_~var_1_12~0 256)) (.cse40 (< .cse43 .cse41)) (.cse11 (and .cse19 .cse20)) (.cse0 (+ .cse44 1))) (let ((.cse10 (forall ((v_z_30 Int)) (or (< 4294967295 v_z_30) (< (mod (div v_z_30 .cse1) 4294967296) .cse41) (< v_z_30 .cse0)))) (.cse8 (or .cse9 (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (< v_z_32 .cse0) (< (mod (div v_z_32 .cse1) 4294967296) .cse41))) .cse11)) (.cse31 (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< v_z_33 .cse0) (< (mod (div v_z_33 .cse1) 4294967296) .cse41)))) (.cse16 (or .cse11 .cse40)) (.cse13 (= .cse23 1)) (.cse15 (<= .cse33 .cse35)) (.cse21 (<= .cse33 1000000000)) (.cse5 (or (< .cse43 .cse2) .cse4)) (.cse6 (<= .cse33 128)) (.cse17 (= (mod c_~var_1_13~0 256) 0)) (.cse7 (= .cse42 (mod c_~var_1_11~0 65536))) (.cse12 (or .cse3 .cse4 (forall ((v_z_29 Int)) (or (< (mod (div v_z_29 .cse1) 4294967296) .cse2) (< v_z_29 .cse0) (< 4294967295 v_z_29))))) (.cse36 (or .cse9 (forall ((v_z_28 Int)) (or (< (mod (div v_z_28 .cse1) 4294967296) .cse41) (< v_z_28 .cse0) (< 4294967295 v_z_28))) .cse11)) (.cse37 (or .cse9 (forall ((v_z_29 Int)) (or (< v_z_29 .cse0) (< (mod (div v_z_29 .cse1) 4294967296) .cse41) (< 4294967295 v_z_29))) .cse11)) (.cse38 (or .cse3 (forall ((v_z_28 Int)) (or (< (mod (div v_z_28 .cse1) 4294967296) .cse2) (< v_z_28 .cse0) (< 4294967295 v_z_28))) .cse4)) (.cse24 (mod c_~var_1_17~0 256)) (.cse29 (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse0) (< (mod (div v_z_34 .cse1) 4294967296) .cse41)))) (.cse22 (or .cse3 (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (< v_z_32 .cse0) (< (mod (div v_z_32 .cse1) 4294967296) .cse2))) .cse4))) (and (or (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse0) (< (mod (div v_z_34 .cse1) 4294967296) .cse2))) .cse3 .cse4) (or .cse3 (and .cse5 .cse6 .cse7)) .cse8 (or .cse3 .cse4 (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< (mod (div v_z_33 .cse1) 4294967296) .cse2) (< v_z_33 .cse0)))) (or .cse9 .cse10 .cse11) .cse12 (or .cse13 (let ((.cse26 (= .cse23 0))) (and (or (let ((.cse18 (forall ((v_z_30 Int)) (or (< 4294967295 v_z_30) (< .cse25 (mod (div v_z_30 .cse1) 4294967296)) (< v_z_30 .cse0)))) (.cse14 (= .cse23 .cse24))) (and (or .cse9 (and .cse14 .cse7 .cse15 .cse16)) (or .cse9 (and .cse17 (or (and .cse14 .cse7 .cse15) .cse18) (or .cse10 (and .cse19 .cse14 .cse20 .cse7 .cse21)))) (or .cse3 (and .cse17 (or .cse10 (and .cse6 .cse14 .cse7 .cse4)) (or (and .cse6 .cse14 .cse7) .cse18))) .cse8 (or .cse3 (and .cse5 .cse6 .cse14 .cse7)) .cse22)) .cse26) (or (not .cse26) (let ((.cse32 (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< .cse25 (mod (div v_z_33 .cse1) 4294967296)) (< v_z_33 .cse0)))) (.cse30 (mod (+ .cse1 (* c_~var_1_1~0 4294967295)) 4294967296)) (.cse34 (not .cse19)) (.cse27 (= .cse24 0))) (and (or .cse9 (and .cse7 .cse16)) (or .cse3 (and .cse5 .cse6 .cse7 .cse27)) (or .cse3 (let ((.cse28 (or (= .cse30 128) .cse7))) (and (or (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse0) (< .cse25 (mod (div v_z_34 .cse1) 4294967296)))) (and .cse6 .cse27 .cse28)) (or .cse29 (and .cse6 .cse27 .cse4 .cse28))))) (or .cse3 (and (or .cse31 (and .cse6 .cse7 .cse27 .cse4)) .cse17 (or .cse32 (and .cse6 .cse7 .cse27)))) (or (and (or (and (or (< .cse33 1000000001) .cse34) .cse7 .cse15 .cse27) .cse32) .cse17 (or .cse31 (and .cse19 .cse20 .cse7 .cse27 .cse21))) .cse9) (or .cse9 (and (or .cse7 (= .cse30 .cse35)) (or (and .cse7 .cse21) .cse34) .cse15 .cse27 (or .cse29 (and .cse19 .cse20 .cse7 .cse21)))))))))) .cse36 (or .cse9 .cse31 .cse11) .cse37 (or .cse3 (forall ((v_z_30 Int)) (or (< (mod (div v_z_30 .cse1) 4294967296) .cse2) (< 4294967295 v_z_30) (< v_z_30 .cse0))) .cse4) .cse38 (or .cse9 (and .cse7 .cse15 .cse16)) (or (not .cse13) (let ((.cse39 (= .cse24 1))) (and (or .cse9 (and .cse39 .cse17 .cse7 .cse15 (or (and .cse19 .cse20 .cse21) .cse40))) (or .cse3 (and .cse5 .cse6 .cse39 .cse17 .cse7)) .cse12 .cse36 .cse37 .cse38))) (or .cse9 .cse29 .cse11) .cse22))))) is different from false [2024-11-27 23:40:38,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-27 23:40:42,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-27 23:40:47,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-27 23:40:51,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-27 23:40:56,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-27 23:41:00,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-27 23:41:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:41:00,665 INFO L93 Difference]: Finished difference Result 166 states and 234 transitions. [2024-11-27 23:41:00,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:41:00,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 234 [2024-11-27 23:41:00,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:41:00,671 INFO L225 Difference]: With dead ends: 166 [2024-11-27 23:41:00,671 INFO L226 Difference]: Without dead ends: 164 [2024-11-27 23:41:00,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 458 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 93.8s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=16, NotChecked=172, Total=650 [2024-11-27 23:41:00,673 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 15 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 48.8s IncrementalHoareTripleChecker+Time [2024-11-27 23:41:00,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 505 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 10 Unknown, 144 Unchecked, 48.8s Time] [2024-11-27 23:41:00,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-27 23:41:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2024-11-27 23:41:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 88 states have internal predecessors, (105), 57 states have call successors, (57), 5 states have call predecessors, (57), 5 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-27 23:41:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2024-11-27 23:41:00,733 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 234 [2024-11-27 23:41:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:41:00,734 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2024-11-27 23:41:00,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:41:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2024-11-27 23:41:00,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-27 23:41:00,736 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:41:00,737 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:41:00,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 23:41:00,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9be897b7-7000-4133-93f5-abe347e07861/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-27 23:41:00,938 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:41:00,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:41:00,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1945584703, now seen corresponding path program 1 times [2024-11-27 23:41:00,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:41:00,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64877765] [2024-11-27 23:41:00,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:41:00,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:41:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:41:21,773 WARN L286 SmtUtils]: Spent 9.37s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:41:39,094 WARN L286 SmtUtils]: Spent 8.76s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:41:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-11-27 23:41:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:41:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64877765] [2024-11-27 23:41:39,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64877765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:41:39,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:41:39,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 23:41:39,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200528563] [2024-11-27 23:41:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:41:39,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 23:41:39,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:41:39,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 23:41:39,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:41:39,369 INFO L87 Difference]: Start difference. First operand 151 states and 219 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:41:49,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:41:54,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:41:56,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:41:58,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:42:11,781 WARN L286 SmtUtils]: Spent 13.59s on a formula simplification that was a NOOP. DAG size: 128 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:42:19,772 WARN L286 SmtUtils]: Spent 7.79s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-27 23:42:20,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:42:20,397 INFO L93 Difference]: Finished difference Result 171 states and 244 transitions. [2024-11-27 23:42:20,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:42:20,400 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 234 [2024-11-27 23:42:20,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:42:20,402 INFO L225 Difference]: With dead ends: 171 [2024-11-27 23:42:20,402 INFO L226 Difference]: Without dead ends: 169 [2024-11-27 23:42:20,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 48.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-27 23:42:20,403 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 32 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:42:20,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 358 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 1 Unknown, 0 Unchecked, 13.1s Time] [2024-11-27 23:42:20,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-27 23:42:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2024-11-27 23:42:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 82 states have (on average 1.170731707317073) internal successors, (96), 82 states have internal predecessors, (96), 57 states have call successors, (57), 5 states have call predecessors, (57), 5 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-27 23:42:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2024-11-27 23:42:20,445 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 234 [2024-11-27 23:42:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:42:20,445 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2024-11-27 23:42:20,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:42:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2024-11-27 23:42:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-27 23:42:20,447 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:42:20,447 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:42:20,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 23:42:20,448 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:42:20,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:42:20,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1484624707, now seen corresponding path program 1 times [2024-11-27 23:42:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:42:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241845632] [2024-11-27 23:42:20,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:42:20,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:42:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:42:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-11-27 23:42:21,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:42:21,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241845632] [2024-11-27 23:42:21,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241845632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:42:21,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:42:21,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 23:42:21,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411157561] [2024-11-27 23:42:21,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:42:21,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:42:21,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:42:21,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:42:21,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:42:21,580 INFO L87 Difference]: Start difference. First operand 145 states and 210 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-27 23:42:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:42:24,469 INFO L93 Difference]: Finished difference Result 452 states and 634 transitions. [2024-11-27 23:42:24,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 23:42:24,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 234 [2024-11-27 23:42:24,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:42:24,472 INFO L225 Difference]: With dead ends: 452 [2024-11-27 23:42:24,472 INFO L226 Difference]: Without dead ends: 352 [2024-11-27 23:42:24,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-27 23:42:24,474 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 163 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-27 23:42:24,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 476 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-27 23:42:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-27 23:42:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 290. [2024-11-27 23:42:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 168 states have (on average 1.1666666666666667) internal successors, (196), 170 states have internal predecessors, (196), 109 states have call successors, (109), 12 states have call predecessors, (109), 12 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2024-11-27 23:42:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 414 transitions. [2024-11-27 23:42:24,572 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 414 transitions. Word has length 234 [2024-11-27 23:42:24,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:42:24,573 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 414 transitions. [2024-11-27 23:42:24,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-27 23:42:24,573 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 414 transitions. [2024-11-27 23:42:24,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-27 23:42:24,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:42:24,575 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 38, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:42:24,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 23:42:24,575 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:42:24,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:42:24,576 INFO L85 PathProgramCache]: Analyzing trace with hash -565784191, now seen corresponding path program 1 times [2024-11-27 23:42:24,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:42:24,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327363633] [2024-11-27 23:42:24,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:42:24,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:42:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:42:35,428 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_6~0 65536)) (.cse0 (div c_~var_1_6~0 65536)) (.cse2 (mod c_~last_1_var_1_6~0 65536)) (.cse3 (div c_~var_1_4~0 65536))) (and (<= (div c_~var_1_1~0 4294967296) 0) (= (mod c_~var_1_1~0 4294967296) 128) (<= (div c_~var_1_11~0 65536) .cse0) (= .cse1 (mod c_~var_1_11~0 65536)) (or (= .cse1 c_~var_1_18~0) (< (mod (+ (* c_~var_1_6~0 c_~var_1_6~0) (* c_~var_1_6~0 c_~var_1_7~0) (* c_~var_1_6~0 .cse0 4294836224) (* 4294901760 .cse0 c_~var_1_7~0)) 4294967296) 129)) (not (= c_~last_1_var_1_18~0 .cse2)) (not (= 128 (mod (+ c_~var_1_4~0 (* 4294901760 .cse3) (* c_~var_1_1~0 4294967295)) 4294967296))) (let ((.cse7 (mod c_~last_1_var_1_18~0 4294967296)) (.cse6 (+ c_~var_1_4~0 (* .cse3 (- 65536)))) (.cse4 (mod c_~last_1_var_1_1~0 4294967296))) (or (and (<= (+ .cse2 1) .cse4) (let ((.cse5 (+ (* (div c_~last_1_var_1_1~0 4294967296) (- 4294967296)) c_~last_1_var_1_1~0))) (<= (+ (* (div .cse5 .cse6 4294967296) 4294967296) .cse7 1) (div .cse5 .cse6)))) (and (let ((.cse8 (let ((.cse9 (* (div c_~last_1_var_1_6~0 65536) (- 65536)))) (+ (* (- 4294967296) (div (+ .cse9 c_~last_1_var_1_6~0) 4294967296)) .cse9 c_~last_1_var_1_6~0)))) (<= (+ .cse7 (* (div .cse8 .cse6 4294967296) 4294967296) 1) (div .cse8 .cse6))) (<= .cse4 .cse2)))))) is different from false [2024-11-27 23:42:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-11-27 23:42:45,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:42:45,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327363633] [2024-11-27 23:42:45,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327363633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:42:45,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:42:45,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 23:42:45,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407207424] [2024-11-27 23:42:45,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:42:45,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 23:42:45,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:42:45,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 23:42:45,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-11-27 23:42:45,959 INFO L87 Difference]: Start difference. First operand 290 states and 414 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-27 23:42:59,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:43:03,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:43:07,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:43:11,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-27 23:43:16,976 WARN L286 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)