./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 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/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_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC --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-6497de0 [2024-11-24 01:56:14,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:56:14,899 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 01:56:14,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:56:14,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:56:14,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:56:14,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:56:14,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:56:14,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:56:14,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:56:14,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:56:14,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:56:14,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:56:14,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:56:14,949 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:56:14,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:56:14,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:56:14,950 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:56:14,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:56:14,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:56:14,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:56:14,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:56:14,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:56:14,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:56:14,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:56:14,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:56:14,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:56:14,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:56:14,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:56:14,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:56:14,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:56:14,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:56:14,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:56:14,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:56:14,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:56:14,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:56:14,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:56:14,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:56:14,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:56:14,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:56:14,953 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:56:14,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:56:14,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:56:14,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:56:14,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:56:14,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:56:14,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:56:14,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:56:14,954 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_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC 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-24 01:56:15,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:56:15,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:56:15,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:56:15,277 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:56:15,277 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:56:15,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i [2024-11-24 01:56:18,353 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/data/4aa1b5815/ce51e61baf234ba286257b0e660eb43a/FLAG5cc7219d1 [2024-11-24 01:56:18,648 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:56:18,648 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i [2024-11-24 01:56:18,660 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/data/4aa1b5815/ce51e61baf234ba286257b0e660eb43a/FLAG5cc7219d1 [2024-11-24 01:56:18,684 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/data/4aa1b5815/ce51e61baf234ba286257b0e660eb43a [2024-11-24 01:56:18,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:56:18,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:56:18,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:56:18,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:56:18,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:56:18,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:56:18" (1/1) ... [2024-11-24 01:56:18,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b31555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:18, skipping insertion in model container [2024-11-24 01:56:18,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:56:18" (1/1) ... [2024-11-24 01:56:18,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:56:18,886 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_477234cd-5951-4146-918a-b2e85944ff08/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i[914,927] [2024-11-24 01:56:18,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:56:18,962 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:56:18,974 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_477234cd-5951-4146-918a-b2e85944ff08/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i[914,927] [2024-11-24 01:56:19,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:56:19,042 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:56:19,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:19 WrapperNode [2024-11-24 01:56:19,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:56:19,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:56:19,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:56:19,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:56:19,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:19" (1/1) ... [2024-11-24 01:56:19,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:19" (1/1) ... [2024-11-24 01:56:19,104 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-24 01:56:19,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:56:19,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:56:19,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:56:19,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:56:19,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:19" (1/1) ... [2024-11-24 01:56:19,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:19" (1/1) ... [2024-11-24 01:56:19,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:19" (1/1) ... [2024-11-24 01:56:19,141 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-24 01:56:19,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:19" (1/1) ... [2024-11-24 01:56:19,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:19" (1/1) ... [2024-11-24 01:56:19,151 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:19" (1/1) ... [2024-11-24 01:56:19,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:19" (1/1) ... [2024-11-24 01:56:19,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:19" (1/1) ... [2024-11-24 01:56:19,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:19" (1/1) ... [2024-11-24 01:56:19,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:19" (1/1) ... [2024-11-24 01:56:19,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:56:19,160 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:56:19,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:56:19,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:56:19,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:19" (1/1) ... [2024-11-24 01:56:19,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:56:19,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:56:19,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:56:19,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:56:19,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:56:19,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 01:56:19,222 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 01:56:19,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 01:56:19,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:56:19,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:56:19,307 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:56:19,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:56:19,692 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-24 01:56:19,692 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:56:19,705 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:56:19,708 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 01:56:19,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:56:19 BoogieIcfgContainer [2024-11-24 01:56:19,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:56:19,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:56:19,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:56:19,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:56:19,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:56:18" (1/3) ... [2024-11-24 01:56:19,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4637cf0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:56:19, skipping insertion in model container [2024-11-24 01:56:19,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:19" (2/3) ... [2024-11-24 01:56:19,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4637cf0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:56:19, skipping insertion in model container [2024-11-24 01:56:19,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:56:19" (3/3) ... [2024-11-24 01:56:19,732 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-6.i [2024-11-24 01:56:19,755 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:56:19,757 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-24 01:56:19,847 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:56:19,866 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;@4228229c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:56:19,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:56:19,872 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-24 01:56:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-24 01:56:19,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:56:19,888 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-24 01:56:19,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:56:19,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:56:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1492909268, now seen corresponding path program 1 times [2024-11-24 01:56:19,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:56:19,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091294370] [2024-11-24 01:56:19,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:56:19,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:56:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:56:20,259 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-24 01:56:20,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:56:20,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091294370] [2024-11-24 01:56:20,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091294370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:56:20,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289718028] [2024-11-24 01:56:20,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:56:20,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:56:20,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:56:20,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:56:20,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 01:56:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:56:20,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 01:56:20,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:56:20,496 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-24 01:56:20,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:56:20,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289718028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:56:20,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:56:20,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-24 01:56:20,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119910610] [2024-11-24 01:56:20,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:56:20,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 01:56:20,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:56:20,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 01:56:20,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:56:20,528 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-24 01:56:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:56:20,559 INFO L93 Difference]: Finished difference Result 101 states and 175 transitions. [2024-11-24 01:56:20,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 01:56:20,561 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-24 01:56:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:56:20,569 INFO L225 Difference]: With dead ends: 101 [2024-11-24 01:56:20,569 INFO L226 Difference]: Without dead ends: 50 [2024-11-24 01:56:20,572 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-24 01:56:20,575 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-24 01:56:20,576 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-24 01:56:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-24 01:56:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-24 01:56:20,617 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-24 01:56:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2024-11-24 01:56:20,628 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 118 [2024-11-24 01:56:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:56:20,628 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2024-11-24 01:56:20,629 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-24 01:56:20,629 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-11-24 01:56:20,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-24 01:56:20,633 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:56:20,633 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-24 01:56:20,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 01:56:20,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-24 01:56:20,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:56:20,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:56:20,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2060601006, now seen corresponding path program 1 times [2024-11-24 01:56:20,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:56:20,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405875239] [2024-11-24 01:56:20,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:56:20,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:56:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:56:53,353 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-24 01:56:53,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:56:53,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405875239] [2024-11-24 01:56:53,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405875239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:56:53,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:56:53,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-24 01:56:53,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571477485] [2024-11-24 01:56:53,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:56:53,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 01:56:53,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:56:53,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 01:56:53,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:56:53,358 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-24 01:57:00,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-24 01:57:04,744 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-24 01:57:12,501 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-24 01:57:14,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-24 01:57:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:57:16,574 INFO L93 Difference]: Finished difference Result 141 states and 198 transitions. [2024-11-24 01:57:16,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 01:57:16,575 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-24 01:57:16,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:57:16,578 INFO L225 Difference]: With dead ends: 141 [2024-11-24 01:57:16,578 INFO L226 Difference]: Without dead ends: 139 [2024-11-24 01:57:16,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-11-24 01:57:16,580 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 151 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 78 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s 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, 14.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:57:16,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 452 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 208 Invalid, 2 Unknown, 0 Unchecked, 14.4s Time] [2024-11-24 01:57:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-24 01:57:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 101. [2024-11-24 01:57:16,603 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-24 01:57:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2024-11-24 01:57:16,605 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 153 transitions. Word has length 118 [2024-11-24 01:57:16,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:57:16,606 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 153 transitions. [2024-11-24 01:57:16,606 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-24 01:57:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 153 transitions. [2024-11-24 01:57:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-24 01:57:16,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:57:16,608 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-24 01:57:16,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 01:57:16,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:57:16,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:16,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2003342704, now seen corresponding path program 1 times [2024-11-24 01:57:16,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:16,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892853339] [2024-11-24 01:57:16,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:57:16,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:57:30,270 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-24 01:57:30,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:57:30,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892853339] [2024-11-24 01:57:30,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892853339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:57:30,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:57:30,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-24 01:57:30,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705622744] [2024-11-24 01:57:30,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:57:30,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 01:57:30,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:57:30,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 01:57:30,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:57:30,273 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-24 01:57:33,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-24 01:57:42,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-24 01:57:46,259 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-24 01:57:55,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-24 01:57:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:57:56,832 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2024-11-24 01:57:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 01:57:56,834 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-24 01:57:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:57:56,836 INFO L225 Difference]: With dead ends: 139 [2024-11-24 01:57:56,836 INFO L226 Difference]: Without dead ends: 137 [2024-11-24 01:57:56,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2024-11-24 01:57:56,838 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 139 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 98 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:57:56,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 469 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 307 Invalid, 1 Unknown, 0 Unchecked, 15.3s Time] [2024-11-24 01:57:56,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-24 01:57:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2024-11-24 01:57:56,868 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-24 01:57:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2024-11-24 01:57:56,873 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 158 transitions. Word has length 118 [2024-11-24 01:57:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:57:56,874 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 158 transitions. [2024-11-24 01:57:56,874 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-24 01:57:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 158 transitions. [2024-11-24 01:57:56,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-24 01:57:56,879 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:57:56,880 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-24 01:57:56,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 01:57:56,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:57:56,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:56,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1223349965, now seen corresponding path program 1 times [2024-11-24 01:57:56,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:56,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133540382] [2024-11-24 01:57:56,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:57:56,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:57:57,135 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-24 01:57:57,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:57:57,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133540382] [2024-11-24 01:57:57,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133540382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:57:57,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:57:57,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:57:57,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428692989] [2024-11-24 01:57:57,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:57:57,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:57:57,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:57:57,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:57:57,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:57:57,144 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-24 01:57:57,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:57:57,625 INFO L93 Difference]: Finished difference Result 288 states and 432 transitions. [2024-11-24 01:57:57,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:57:57,626 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-24 01:57:57,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:57:57,630 INFO L225 Difference]: With dead ends: 288 [2024-11-24 01:57:57,633 INFO L226 Difference]: Without dead ends: 186 [2024-11-24 01:57:57,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:57:57,634 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-24 01:57:57,635 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-24 01:57:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-24 01:57:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 151. [2024-11-24 01:57:57,678 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-24 01:57:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 229 transitions. [2024-11-24 01:57:57,680 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 229 transitions. Word has length 119 [2024-11-24 01:57:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:57:57,681 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 229 transitions. [2024-11-24 01:57:57,681 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-24 01:57:57,681 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 229 transitions. [2024-11-24 01:57:57,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-24 01:57:57,685 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:57:57,685 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-24 01:57:57,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 01:57:57,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:57:57,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:57:57,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2032696591, now seen corresponding path program 1 times [2024-11-24 01:57:57,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:57:57,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865257569] [2024-11-24 01:57:57,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:57:57,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:57:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:58:24,440 WARN L286 SmtUtils]: Spent 5.26s 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) [2024-11-24 01:58:24,497 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-24 01:58:24,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:58:24,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865257569] [2024-11-24 01:58:24,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865257569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:58:24,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:58:24,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-24 01:58:24,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774433076] [2024-11-24 01:58:24,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:58:24,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 01:58:24,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:58:24,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 01:58:24,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:58:24,500 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-24 01:58:29,722 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-24 01:58:33,949 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-24 01:58:37,953 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-24 01:58:41,956 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-24 01:58:45,960 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-24 01:58:51,274 WARN L286 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 125 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 01:58:54,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-24 01:59:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:59:02,475 INFO L93 Difference]: Finished difference Result 219 states and 313 transitions. [2024-11-24 01:59:02,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 01:59:02,476 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-24 01:59:02,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:59:02,478 INFO L225 Difference]: With dead ends: 219 [2024-11-24 01:59:02,478 INFO L226 Difference]: Without dead ends: 217 [2024-11-24 01:59:02,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-24 01:59:02,479 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 87 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 59 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:59:02,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 536 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 335 Invalid, 5 Unknown, 0 Unchecked, 25.4s Time] [2024-11-24 01:59:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-24 01:59:02,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 152. [2024-11-24 01:59:02,515 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-24 01:59:02,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2024-11-24 01:59:02,519 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 119 [2024-11-24 01:59:02,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:59:02,520 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2024-11-24 01:59:02,522 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-24 01:59:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2024-11-24 01:59:02,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-24 01:59:02,524 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:59:02,524 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-24 01:59:02,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 01:59:02,524 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:59:02,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:59:02,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1975438289, now seen corresponding path program 1 times [2024-11-24 01:59:02,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:59:02,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807682063] [2024-11-24 01:59:02,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:59:02,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:59:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:59:28,941 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-24 01:59:28,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:59:28,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807682063] [2024-11-24 01:59:28,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807682063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:59:28,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:59:28,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-24 01:59:28,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702603906] [2024-11-24 01:59:28,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:59:28,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 01:59:28,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:59:28,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 01:59:28,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:59:28,944 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-24 01:59:42,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-24 01:59:53,224 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 148 DAG size of output: 123 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 01:59:54,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-24 01:59:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:59:55,223 INFO L93 Difference]: Finished difference Result 219 states and 313 transitions. [2024-11-24 01:59:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 01:59:55,224 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-24 01:59:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:59:55,226 INFO L225 Difference]: With dead ends: 219 [2024-11-24 01:59:55,226 INFO L226 Difference]: Without dead ends: 217 [2024-11-24 01:59:55,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2024-11-24 01:59:55,227 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 107 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:59:55,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 531 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-24 01:59:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-24 01:59:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 150. [2024-11-24 01:59:55,266 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-24 01:59:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2024-11-24 01:59:55,268 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 119 [2024-11-24 01:59:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:59:55,269 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2024-11-24 01:59:55,269 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-24 01:59:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2024-11-24 01:59:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-24 01:59:55,272 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:59:55,272 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-24 01:59:55,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 01:59:55,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:59:55,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:59:55,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1634763599, now seen corresponding path program 1 times [2024-11-24 01:59:55,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:59:55,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027089723] [2024-11-24 01:59:55,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:59:55,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:59:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:59:55,543 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-24 01:59:55,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:59:55,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027089723] [2024-11-24 01:59:55,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027089723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:59:55,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095606810] [2024-11-24 01:59:55,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:59:55,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:59:55,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:59:55,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:59:55,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 01:59:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:59:55,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-24 01:59:55,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:59:56,237 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-24 01:59:56,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:59:57,084 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-24 01:59:57,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095606810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:59:57,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:59:57,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2024-11-24 01:59:57,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510307775] [2024-11-24 01:59:57,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:59:57,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 01:59:57,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:59:57,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 01:59:57,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:59:57,087 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-24 01:59:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:59:58,488 INFO L93 Difference]: Finished difference Result 593 states and 865 transitions. [2024-11-24 01:59:58,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-24 01:59:58,489 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-24 01:59:58,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:59:58,493 INFO L225 Difference]: With dead ends: 593 [2024-11-24 01:59:58,493 INFO L226 Difference]: Without dead ends: 446 [2024-11-24 01:59:58,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2024-11-24 01:59:58,496 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 167 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:59:58,498 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.1s Time] [2024-11-24 01:59:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-24 01:59:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 294. [2024-11-24 01:59:58,601 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-24 01:59:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 434 transitions. [2024-11-24 01:59:58,606 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 434 transitions. Word has length 119 [2024-11-24 01:59:58,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:59:58,607 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 434 transitions. [2024-11-24 01:59:58,607 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-24 01:59:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 434 transitions. [2024-11-24 01:59:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-24 01:59:58,609 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:59:58,609 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-24 01:59:58,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-24 01:59:58,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:59:58,813 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:59:58,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:59:58,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1795166832, now seen corresponding path program 1 times [2024-11-24 01:59:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:59:58,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611800254] [2024-11-24 01:59:58,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:59:58,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:59:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-24 01:59:58,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1309189952] [2024-11-24 01:59:58,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:59:58,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:59:58,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:59:58,908 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:59:58,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 01:59:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:59:59,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-24 01:59:59,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:00:00,250 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-24 02:00:00,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:00:05,205 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-24 02:00:05,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:00:05,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611800254] [2024-11-24 02:00:05,206 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-24 02:00:05,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309189952] [2024-11-24 02:00:05,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309189952] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 02:00:05,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 02:00:05,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2024-11-24 02:00:05,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697417702] [2024-11-24 02:00:05,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:00:05,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 02:00:05,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:00:05,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 02:00:05,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-24 02:00:05,207 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-24 02:00:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:00:07,859 INFO L93 Difference]: Finished difference Result 550 states and 800 transitions. [2024-11-24 02:00:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 02:00:07,860 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-24 02:00:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:00:07,863 INFO L225 Difference]: With dead ends: 550 [2024-11-24 02:00:07,863 INFO L226 Difference]: Without dead ends: 299 [2024-11-24 02:00:07,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2024-11-24 02:00:07,865 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 81 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.0s IncrementalHoareTripleChecker+Time [2024-11-24 02:00:07,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 357 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-24 02:00:07,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-24 02:00:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 251. [2024-11-24 02:00:07,932 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-24 02:00:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 367 transitions. [2024-11-24 02:00:07,935 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 367 transitions. Word has length 120 [2024-11-24 02:00:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:00:07,935 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 367 transitions. [2024-11-24 02:00:07,935 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-24 02:00:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 367 transitions. [2024-11-24 02:00:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-24 02:00:07,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:00:07,940 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-24 02:00:07,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-24 02:00:08,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:00:08,141 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:00:08,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:00:08,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1254402368, now seen corresponding path program 1 times [2024-11-24 02:00:08,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:00:08,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754532238] [2024-11-24 02:00:08,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:00:08,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:00:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:00:16,499 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-24 02:00:16,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:00:16,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754532238] [2024-11-24 02:00:16,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754532238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:00:16,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:00:16,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 02:00:16,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982083614] [2024-11-24 02:00:16,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:00:16,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 02:00:16,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:00:16,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 02:00:16,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-24 02:00:16,501 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-24 02:00:21,797 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-24 02:00:25,871 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-24 02:00:29,877 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-24 02:00:30,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-24 02:00:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:00:35,902 INFO L93 Difference]: Finished difference Result 314 states and 449 transitions. [2024-11-24 02:00:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 02:00:35,904 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-24 02:00:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:00:35,907 INFO L225 Difference]: With dead ends: 314 [2024-11-24 02:00:35,907 INFO L226 Difference]: Without dead ends: 312 [2024-11-24 02:00:35,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-24 02:00:35,910 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 47 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2024-11-24 02:00:35,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 345 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 4 Unknown, 0 Unchecked, 15.6s Time] [2024-11-24 02:00:35,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-24 02:00:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 255. [2024-11-24 02:00:35,983 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-24 02:00:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 374 transitions. [2024-11-24 02:00:35,986 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 374 transitions. Word has length 233 [2024-11-24 02:00:35,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:00:35,987 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 374 transitions. [2024-11-24 02:00:35,987 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-24 02:00:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 374 transitions. [2024-11-24 02:00:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-24 02:00:35,991 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:00:35,991 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-24 02:00:35,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 02:00:35,992 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:00:35,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:00:35,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1197144066, now seen corresponding path program 1 times [2024-11-24 02:00:35,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:00:35,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561731475] [2024-11-24 02:00:35,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:00:35,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:00:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:00:54,250 WARN L286 SmtUtils]: Spent 10.92s 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-24 02:01:06,185 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-24 02:01:06,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:06,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561731475] [2024-11-24 02:01:06,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561731475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:06,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:06,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 02:01:06,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951723357] [2024-11-24 02:01:06,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:06,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 02:01:06,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:06,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 02:01:06,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-24 02:01:06,187 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-24 02:01:07,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-24 02:01:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:01:10,908 INFO L93 Difference]: Finished difference Result 300 states and 432 transitions. [2024-11-24 02:01:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 02:01:10,909 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-24 02:01:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:01:10,911 INFO L225 Difference]: With dead ends: 300 [2024-11-24 02:01:10,911 INFO L226 Difference]: Without dead ends: 298 [2024-11-24 02:01:10,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-24 02:01:10,913 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 31 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-24 02:01:10,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 330 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-24 02:01:10,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-24 02:01:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 151. [2024-11-24 02:01:10,978 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-24 02:01:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2024-11-24 02:01:10,980 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 233 [2024-11-24 02:01:10,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:01:10,981 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2024-11-24 02:01:10,981 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-24 02:01:10,982 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2024-11-24 02:01:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-24 02:01:10,985 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:01:10,985 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-24 02:01:10,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 02:01:10,987 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:01:10,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:10,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2000995963, now seen corresponding path program 1 times [2024-11-24 02:01:10,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:10,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939420872] [2024-11-24 02:01:10,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:10,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:01:27,893 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-24 02:01:27,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:01:27,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939420872] [2024-11-24 02:01:27,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939420872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:01:27,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:01:27,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 02:01:27,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190016497] [2024-11-24 02:01:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:01:27,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 02:01:27,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:01:27,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 02:01:27,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-24 02:01:27,895 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-24 02:01:35,239 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-24 02:01:43,754 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-24 02:01:46,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-24 02:01:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:01:52,775 INFO L93 Difference]: Finished difference Result 170 states and 243 transitions. [2024-11-24 02:01:52,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 02:01:52,776 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-24 02:01:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:01:52,778 INFO L225 Difference]: With dead ends: 170 [2024-11-24 02:01:52,778 INFO L226 Difference]: Without dead ends: 168 [2024-11-24 02:01:52,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-24 02:01:52,779 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 24 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-11-24 02:01:52,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 453 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 13.2s Time] [2024-11-24 02:01:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-24 02:01:52,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2024-11-24 02:01:52,828 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-24 02:01:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2024-11-24 02:01:52,830 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 234 [2024-11-24 02:01:52,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:01:52,831 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2024-11-24 02:01:52,831 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-24 02:01:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2024-11-24 02:01:52,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-24 02:01:52,833 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:01:52,833 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-24 02:01:52,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 02:01:52,833 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:01:52,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:01:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1943737661, now seen corresponding path program 1 times [2024-11-24 02:01:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:01:52,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830312708] [2024-11-24 02:01:52,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:01:52,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:01:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:02:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 4 proven. 2 refuted. 1 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-11-24 02:02:05,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:02:05,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830312708] [2024-11-24 02:02:05,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830312708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:02:05,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591203065] [2024-11-24 02:02:05,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:02:05,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:02:05,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:02:05,893 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:02:05,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 02:02:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:02:06,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-24 02:02:06,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:02:48,767 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-24 02:02:48,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:04:30,055 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-24 02:05:08,093 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (mod c_~var_1_6~0 65536)) (.cse12 (mod c_~var_1_1~0 4294967296)) (.cse14 (mod c_~last_1_var_1_6~0 65536))) (let ((.cse13 (= c_~last_1_var_1_18~0 .cse14)) (.cse6 (= .cse12 128)) (.cse15 (* .cse16 .cse16)) (.cse3 (mod c_~var_1_4~0 65536))) (let ((.cse10 (mod (div .cse14 .cse3) 4294967296)) (.cse8 (= .cse16 (mod c_~var_1_11~0 65536))) (.cse0 (forall ((~var_1_7~0 Int)) (< 128 (mod (+ .cse15 (* .cse16 ~var_1_7~0)) 4294967296)))) (.cse1 (not .cse6)) (.cse5 (not .cse13)) (.cse4 (+ c_~last_1_var_1_18~0 1)) (.cse7 (forall ((~var_1_7~0 Int)) (< .cse12 (mod (+ .cse15 (* .cse16 ~var_1_7~0)) 4294967296)))) (.cse2 (+ .cse14 1)) (.cse11 (+ (mod c_~last_1_var_1_18~0 4294967296) 1)) (.cse9 (and (= 1000000000 .cse12) .cse13))) (and (or .cse0 .cse1 (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (< v_z_32 .cse2) (< (mod (div v_z_32 .cse3) 4294967296) .cse4))) .cse5) (or .cse6 .cse7 (and .cse8 (or .cse9 (< .cse10 .cse11)))) (or .cse0 .cse1 (forall ((v_z_28 Int)) (or (< (mod (div v_z_28 .cse3) 4294967296) .cse4) (< v_z_28 .cse2) (< 4294967295 v_z_28))) .cse5) (or .cse6 .cse7 (forall ((v_z_32 Int)) (or (< 4294967295 v_z_32) (< v_z_32 .cse2) (< (mod (div v_z_32 .cse3) 4294967296) .cse11))) .cse9) (or .cse6 (forall ((v_z_30 Int)) (or (< 4294967295 v_z_30) (< (mod (div v_z_30 .cse3) 4294967296) .cse11) (< v_z_30 .cse2))) .cse7 .cse9) (or .cse0 .cse1 (and (or (< .cse10 .cse4) .cse5) .cse8)) (or .cse6 (forall ((v_z_29 Int)) (or (< v_z_29 .cse2) (< (mod (div v_z_29 .cse3) 4294967296) .cse11) (< 4294967295 v_z_29))) .cse7 .cse9) (or .cse6 .cse7 (forall ((v_z_28 Int)) (or (< (mod (div v_z_28 .cse3) 4294967296) .cse11) (< v_z_28 .cse2) (< 4294967295 v_z_28))) .cse9) (or .cse6 (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< v_z_33 .cse2) (< (mod (div v_z_33 .cse3) 4294967296) .cse11))) .cse7 .cse9) (or .cse0 .cse1 (forall ((v_z_30 Int)) (or (< (mod (div v_z_30 .cse3) 4294967296) .cse4) (< 4294967295 v_z_30) (< v_z_30 .cse2))) .cse5) (or .cse0 (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse2) (< (mod (div v_z_34 .cse3) 4294967296) .cse4))) .cse1 .cse5) (or .cse0 .cse1 .cse5 (forall ((v_z_33 Int)) (or (< 4294967295 v_z_33) (< (mod (div v_z_33 .cse3) 4294967296) .cse4) (< v_z_33 .cse2)))) (or .cse0 .cse1 .cse5 (forall ((v_z_29 Int)) (or (< (mod (div v_z_29 .cse3) 4294967296) .cse4) (< v_z_29 .cse2) (< 4294967295 v_z_29)))) (or .cse6 .cse7 (forall ((v_z_34 Int)) (or (< 4294967295 v_z_34) (< v_z_34 .cse2) (< (mod (div v_z_34 .cse3) 4294967296) .cse11))) .cse9))))) is different from false [2024-11-24 02:05:38,178 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-24 02:05:55,507 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-24 02:05:55,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591203065] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 02:05:55,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:05:55,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 12] total 25 [2024-11-24 02:05:55,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970104583] [2024-11-24 02:05:55,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:05:55,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 02:05:55,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:55,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 02:05:55,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=376, Unknown=14, NotChecked=126, Total=600 [2024-11-24 02:05:55,509 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-24 02:06:00,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 02:06:04,152 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-24 02:06:08,157 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-24 02:06:12,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 02:06:16,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 02:06:20,820 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-24 02:06:25,769 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-24 02:06:26,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 02:06:30,966 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-24 02:06:34,973 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-24 02:06:39,839 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-24 02:06:44,386 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-24 02:06:48,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 02:06:50,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 02:06:55,002 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-24 02:06:59,007 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-24 02:07:03,016 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-24 02:07:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:07:03,017 INFO L93 Difference]: Finished difference Result 169 states and 242 transitions. [2024-11-24 02:07:03,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 02:07:03,024 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-24 02:07:03,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:07:03,026 INFO L225 Difference]: With dead ends: 169 [2024-11-24 02:07:03,026 INFO L226 Difference]: Without dead ends: 167 [2024-11-24 02:07:03,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 458 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 80.5s TimeCoverageRelationStatistics Valid=86, Invalid=377, Unknown=15, NotChecked=172, Total=650 [2024-11-24 02:07:03,027 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 17 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 62.7s IncrementalHoareTripleChecker+Time [2024-11-24 02:07:03,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 501 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 12 Unknown, 146 Unchecked, 62.7s Time] [2024-11-24 02:07:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-24 02:07:03,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 151. [2024-11-24 02:07:03,075 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-24 02:07:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2024-11-24 02:07:03,076 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 234 [2024-11-24 02:07:03,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:07:03,077 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2024-11-24 02:07:03,077 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-24 02:07:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2024-11-24 02:07:03,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-24 02:07:03,079 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:07:03,079 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-24 02:07:03,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-24 02:07:03,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_477234cd-5951-4146-918a-b2e85944ff08/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-24 02:07:03,280 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:07:03,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:07:03,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1945584703, now seen corresponding path program 1 times [2024-11-24 02:07:03,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:07:03,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989188919] [2024-11-24 02:07:03,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:07:03,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:07:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:07:19,633 WARN L286 SmtUtils]: Spent 7.74s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 02:07:38,144 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-24 02:07:38,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:07:38,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989188919] [2024-11-24 02:07:38,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989188919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:07:38,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:07:38,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 02:07:38,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463241220] [2024-11-24 02:07:38,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:07:38,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 02:07:38,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:07:38,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 02:07:38,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-24 02:07:38,146 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-24 02:07:58,501 WARN L286 SmtUtils]: Spent 13.60s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 02:08:02,513 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-24 02:08:11,839 WARN L286 SmtUtils]: Spent 9.14s 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-24 02:08:20,364 WARN L286 SmtUtils]: Spent 8.38s 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-24 02:08:23,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-24 02:08:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:08:24,904 INFO L93 Difference]: Finished difference Result 171 states and 244 transitions. [2024-11-24 02:08:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 02:08:24,905 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-24 02:08:24,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:08:24,907 INFO L225 Difference]: With dead ends: 171 [2024-11-24 02:08:24,907 INFO L226 Difference]: Without dead ends: 169 [2024-11-24 02:08:24,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 43.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-24 02:08:24,908 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 20 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2024-11-24 02:08:24,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 467 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 1 Unknown, 0 Unchecked, 11.5s Time] [2024-11-24 02:08:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-24 02:08:24,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2024-11-24 02:08:24,963 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-24 02:08:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2024-11-24 02:08:24,965 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 234 [2024-11-24 02:08:24,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:08:24,966 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2024-11-24 02:08:24,966 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-24 02:08:24,966 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2024-11-24 02:08:24,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-24 02:08:24,968 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:08:24,968 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-24 02:08:24,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 02:08:24,969 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:08:24,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:08:24,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1484624707, now seen corresponding path program 1 times [2024-11-24 02:08:24,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:08:24,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437005056] [2024-11-24 02:08:24,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:08:24,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:08:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:08:26,068 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-24 02:08:26,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:08:26,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437005056] [2024-11-24 02:08:26,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437005056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:08:26,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:08:26,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 02:08:26,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74569680] [2024-11-24 02:08:26,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:08:26,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 02:08:26,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:08:26,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 02:08:26,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-24 02:08:26,071 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-24 02:08:28,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:08:28,584 INFO L93 Difference]: Finished difference Result 452 states and 634 transitions. [2024-11-24 02:08:28,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 02:08:28,584 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-24 02:08:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:08:28,587 INFO L225 Difference]: With dead ends: 452 [2024-11-24 02:08:28,587 INFO L226 Difference]: Without dead ends: 352 [2024-11-24 02:08:28,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-24 02:08:28,589 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 148 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-24 02:08:28,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 504 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-24 02:08:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-24 02:08:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 290. [2024-11-24 02:08:28,670 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-24 02:08:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 414 transitions. [2024-11-24 02:08:28,673 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 414 transitions. Word has length 234 [2024-11-24 02:08:28,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:08:28,674 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 414 transitions. [2024-11-24 02:08:28,674 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-24 02:08:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 414 transitions. [2024-11-24 02:08:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-24 02:08:28,675 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:08:28,676 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-24 02:08:28,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 02:08:28,676 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:08:28,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:08:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash -565784191, now seen corresponding path program 1 times [2024-11-24 02:08:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:08:28,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953935644] [2024-11-24 02:08:28,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:08:28,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:08:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:08:39,786 WARN L286 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 02:09:03,518 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-24 02:09:03,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:09:03,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953935644] [2024-11-24 02:09:03,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953935644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:09:03,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:09:03,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 02:09:03,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53082579] [2024-11-24 02:09:03,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:09:03,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 02:09:03,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:09:03,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 02:09:03,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2024-11-24 02:09:03,520 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-24 02:09:09,379 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-24 02:09:14,727 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-24 02:09:18,734 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-24 02:09:22,741 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-24 02:09:26,746 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-24 02:09:34,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:09:34,714 INFO L93 Difference]: Finished difference Result 345 states and 485 transitions. [2024-11-24 02:09:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 02:09:34,717 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 234 [2024-11-24 02:09:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:09:34,722 INFO L225 Difference]: With dead ends: 345 [2024-11-24 02:09:34,722 INFO L226 Difference]: Without dead ends: 343 [2024-11-24 02:09:34,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=37, Invalid=94, Unknown=1, NotChecked=0, Total=132 [2024-11-24 02:09:34,723 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 31 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2024-11-24 02:09:34,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 475 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 5 Unknown, 0 Unchecked, 25.0s Time] [2024-11-24 02:09:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-24 02:09:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 291. [2024-11-24 02:09:34,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 169 states have (on average 1.1715976331360947) internal successors, (198), 171 states have internal predecessors, (198), 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-24 02:09:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 416 transitions. [2024-11-24 02:09:34,847 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 416 transitions. Word has length 234 [2024-11-24 02:09:34,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:09:34,848 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 416 transitions. [2024-11-24 02:09:34,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-24 02:09:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 416 transitions. [2024-11-24 02:09:34,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-24 02:09:34,850 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:09:34,851 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-24 02:09:34,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 02:09:34,851 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:09:34,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:09:34,852 INFO L85 PathProgramCache]: Analyzing trace with hash -508525889, now seen corresponding path program 1 times [2024-11-24 02:09:34,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:09:34,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767845152] [2024-11-24 02:09:34,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:09:34,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:09:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:10:02,327 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-24 02:10:02,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:10:02,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767845152] [2024-11-24 02:10:02,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767845152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:10:02,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:10:02,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 02:10:02,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584280015] [2024-11-24 02:10:02,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:10:02,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 02:10:02,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:10:02,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 02:10:02,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-24 02:10:02,329 INFO L87 Difference]: Start difference. First operand 291 states and 416 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-24 02:10:08,065 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-24 02:10:12,074 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-24 02:10:16,082 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-24 02:10:22,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-24 02:10:26,361 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-24 02:10:32,205 WARN L286 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 108 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 02:10:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:10:34,969 INFO L93 Difference]: Finished difference Result 354 states and 493 transitions. [2024-11-24 02:10:34,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 02:10:34,972 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 234 [2024-11-24 02:10:34,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:10:34,974 INFO L225 Difference]: With dead ends: 354 [2024-11-24 02:10:34,974 INFO L226 Difference]: Without dead ends: 352 [2024-11-24 02:10:34,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-24 02:10:34,975 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 30 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2024-11-24 02:10:34,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 523 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 23.4s Time] [2024-11-24 02:10:34,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-24 02:10:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 292. [2024-11-24 02:10:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 170 states have (on average 1.1764705882352942) internal successors, (200), 172 states have internal predecessors, (200), 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-24 02:10:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 418 transitions. [2024-11-24 02:10:35,093 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 418 transitions. Word has length 234 [2024-11-24 02:10:35,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:10:35,094 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 418 transitions. [2024-11-24 02:10:35,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-24 02:10:35,094 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 418 transitions. [2024-11-24 02:10:35,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-24 02:10:35,096 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:10:35,097 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-24 02:10:35,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-24 02:10:35,097 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:10:35,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:10:35,097 INFO L85 PathProgramCache]: Analyzing trace with hash -510372931, now seen corresponding path program 1 times [2024-11-24 02:10:35,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:10:35,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446065536] [2024-11-24 02:10:35,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:10:35,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:10:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:10:56,247 WARN L286 SmtUtils]: Spent 6.41s 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)