./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/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_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2523ced2438443f67ce3f9b2a31659324ab8c393814038e5cf118fc2fe7fb5b1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 12:40:01,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 12:40:01,652 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 12:40:01,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 12:40:01,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 12:40:01,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 12:40:01,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 12:40:01,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 12:40:01,681 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 12:40:01,681 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 12:40:01,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 12:40:01,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 12:40:01,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 12:40:01,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 12:40:01,682 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 12:40:01,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 12:40:01,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 12:40:01,682 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 12:40:01,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 12:40:01,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 12:40:01,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 12:40:01,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 12:40:01,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 12:40:01,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 12:40:01,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 12:40:01,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 12:40:01,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 12:40:01,683 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 12:40:01,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 12:40:01,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 12:40:01,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 12:40:01,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 12:40:01,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:40:01,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 12:40:01,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 12:40:01,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 12:40:01,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 12:40:01,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:40:01,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 12:40:01,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 12:40:01,684 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 12:40:01,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 12:40:01,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 12:40:01,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 12:40:01,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 12:40:01,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 12:40:01,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 12:40:01,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 12:40:01,685 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_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1 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-12-02 12:40:01,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 12:40:01,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 12:40:01,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 12:40:01,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 12:40:01,946 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 12:40:01,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i [2024-12-02 12:40:04,630 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/data/d1858ebe0/55df73779a25463da7a2521cd19ac95e/FLAG802fa246b [2024-12-02 12:40:04,840 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 12:40:04,841 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i [2024-12-02 12:40:04,849 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/data/d1858ebe0/55df73779a25463da7a2521cd19ac95e/FLAG802fa246b [2024-12-02 12:40:04,863 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/data/d1858ebe0/55df73779a25463da7a2521cd19ac95e [2024-12-02 12:40:04,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 12:40:04,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 12:40:04,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 12:40:04,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 12:40:04,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 12:40:04,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:40:04" (1/1) ... [2024-12-02 12:40:04,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2423275e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:04, skipping insertion in model container [2024-12-02 12:40:04,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:40:04" (1/1) ... [2024-12-02 12:40:04,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 12:40:05,025 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_8be92733-3ff1-4e6d-948a-309b11f5c03a/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i[914,927] [2024-12-02 12:40:05,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 12:40:05,076 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 12:40:05,086 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_8be92733-3ff1-4e6d-948a-309b11f5c03a/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-6.i[914,927] [2024-12-02 12:40:05,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 12:40:05,120 INFO L204 MainTranslator]: Completed translation [2024-12-02 12:40:05,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:05 WrapperNode [2024-12-02 12:40:05,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 12:40:05,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 12:40:05,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 12:40:05,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 12:40:05,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:05" (1/1) ... [2024-12-02 12:40:05,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:05" (1/1) ... [2024-12-02 12:40:05,163 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-12-02 12:40:05,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 12:40:05,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 12:40:05,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 12:40:05,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 12:40:05,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:05" (1/1) ... [2024-12-02 12:40:05,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:05" (1/1) ... [2024-12-02 12:40:05,177 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:05" (1/1) ... [2024-12-02 12:40:05,192 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-12-02 12:40:05,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:05" (1/1) ... [2024-12-02 12:40:05,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:05" (1/1) ... [2024-12-02 12:40:05,199 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:05" (1/1) ... [2024-12-02 12:40:05,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:05" (1/1) ... [2024-12-02 12:40:05,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:05" (1/1) ... [2024-12-02 12:40:05,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:05" (1/1) ... [2024-12-02 12:40:05,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:05" (1/1) ... [2024-12-02 12:40:05,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 12:40:05,209 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 12:40:05,209 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 12:40:05,209 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 12:40:05,210 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:05" (1/1) ... [2024-12-02 12:40:05,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 12:40:05,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:40:05,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 12:40:05,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 12:40:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 12:40:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-02 12:40:05,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-02 12:40:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 12:40:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 12:40:05,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 12:40:05,338 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 12:40:05,340 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 12:40:05,570 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-12-02 12:40:05,571 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 12:40:05,579 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 12:40:05,580 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 12:40:05,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:40:05 BoogieIcfgContainer [2024-12-02 12:40:05,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 12:40:05,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 12:40:05,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 12:40:05,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 12:40:05,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:40:04" (1/3) ... [2024-12-02 12:40:05,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4732408e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:40:05, skipping insertion in model container [2024-12-02 12:40:05,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:05" (2/3) ... [2024-12-02 12:40:05,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4732408e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:40:05, skipping insertion in model container [2024-12-02 12:40:05,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:40:05" (3/3) ... [2024-12-02 12:40:05,588 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-6.i [2024-12-02 12:40:05,599 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 12:40:05,600 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-12-02 12:40:05,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 12:40:05,655 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;@654589ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 12:40:05,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 12:40:05,658 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-12-02 12:40:05,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-02 12:40:05,665 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:40:05,666 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-12-02 12:40:05,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:40:05,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:40:05,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1492909268, now seen corresponding path program 1 times [2024-12-02 12:40:05,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:40:05,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080924551] [2024-12-02 12:40:05,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:40:05,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:40:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:40:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-12-02 12:40:05,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:40:05,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080924551] [2024-12-02 12:40:05,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080924551] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:40:05,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246739701] [2024-12-02 12:40:05,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:40:05,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:40:05,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:40:05,902 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:40:05,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 12:40:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:40:06,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-12-02 12:40:06,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:40:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-12-02 12:40:06,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 12:40:06,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246739701] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:40:06,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 12:40:06,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-12-02 12:40:06,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446302677] [2024-12-02 12:40:06,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:40:06,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-02 12:40:06,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:40:06,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-02 12:40:06,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-02 12:40:06,093 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-12-02 12:40:06,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:40:06,113 INFO L93 Difference]: Finished difference Result 101 states and 175 transitions. [2024-12-02 12:40:06,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-02 12:40:06,115 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-12-02 12:40:06,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:40:06,120 INFO L225 Difference]: With dead ends: 101 [2024-12-02 12:40:06,120 INFO L226 Difference]: Without dead ends: 50 [2024-12-02 12:40:06,122 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-12-02 12:40:06,125 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-12-02 12:40:06,126 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-12-02 12:40:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-12-02 12:40:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-12-02 12:40:06,154 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-12-02 12:40:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2024-12-02 12:40:06,158 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 118 [2024-12-02 12:40:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:40:06,159 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2024-12-02 12:40:06,159 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-12-02 12:40:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-12-02 12:40:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-02 12:40:06,161 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:40:06,161 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-12-02 12:40:06,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 12:40:06,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-12-02 12:40:06,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:40:06,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:40:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2060601006, now seen corresponding path program 1 times [2024-12-02 12:40:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:40:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80974220] [2024-12-02 12:40:06,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:40:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:40:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:40:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 12:40:38,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:40:38,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80974220] [2024-12-02 12:40:38,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80974220] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:40:38,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:40:38,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 12:40:38,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696381351] [2024-12-02 12:40:38,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:40:38,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:40:38,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:40:38,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:40:38,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:40:38,513 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-12-02 12:40:41,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-02 12:40:47,010 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-12-02 12:40:49,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-02 12:40:52,347 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-12-02 12:40:59,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-02 12:41:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:00,260 INFO L93 Difference]: Finished difference Result 141 states and 198 transitions. [2024-12-02 12:41:00,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 12:41:00,261 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-12-02 12:41:00,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:00,263 INFO L225 Difference]: With dead ends: 141 [2024-12-02 12:41:00,263 INFO L226 Difference]: Without dead ends: 139 [2024-12-02 12:41:00,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-12-02 12:41:00,264 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 151 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 78 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:00,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 452 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 13.6s Time] [2024-12-02 12:41:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-12-02 12:41:00,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 101. [2024-12-02 12:41:00,281 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-12-02 12:41:00,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2024-12-02 12:41:00,282 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 153 transitions. Word has length 118 [2024-12-02 12:41:00,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:00,283 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 153 transitions. [2024-12-02 12:41:00,283 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-12-02 12:41:00,283 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 153 transitions. [2024-12-02 12:41:00,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-02 12:41:00,284 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:00,284 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-12-02 12:41:00,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 12:41:00,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:41:00,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2003342704, now seen corresponding path program 1 times [2024-12-02 12:41:00,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:00,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860127779] [2024-12-02 12:41:00,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:00,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:15,064 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 12:41:15,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:15,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860127779] [2024-12-02 12:41:15,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860127779] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:15,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:15,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 12:41:15,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55683421] [2024-12-02 12:41:15,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:15,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:41:15,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:15,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:41:15,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:41:15,067 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-12-02 12:41:25,981 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-12-02 12:41:29,996 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-12-02 12:41:32,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-02 12:41:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:39,778 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2024-12-02 12:41:39,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 12:41:39,779 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-12-02 12:41:39,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:39,780 INFO L225 Difference]: With dead ends: 139 [2024-12-02 12:41:39,780 INFO L226 Difference]: Without dead ends: 137 [2024-12-02 12:41:39,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2024-12-02 12:41:39,781 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 139 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 98 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:39,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 469 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 306 Invalid, 2 Unknown, 0 Unchecked, 14.9s Time] [2024-12-02 12:41:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-12-02 12:41:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2024-12-02 12:41:39,797 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-12-02 12:41:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2024-12-02 12:41:39,799 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 158 transitions. Word has length 118 [2024-12-02 12:41:39,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:39,800 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 158 transitions. [2024-12-02 12:41:39,800 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-12-02 12:41:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 158 transitions. [2024-12-02 12:41:39,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-02 12:41:39,802 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:39,802 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-12-02 12:41:39,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 12:41:39,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:41:39,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:39,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1223349965, now seen corresponding path program 1 times [2024-12-02 12:41:39,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:39,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783915984] [2024-12-02 12:41:39,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:39,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 12:41:39,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:39,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783915984] [2024-12-02 12:41:39,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783915984] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:39,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:39,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 12:41:39,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258486490] [2024-12-02 12:41:39,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:39,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 12:41:39,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:39,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 12:41:39,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 12:41:39,972 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-12-02 12:41:40,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:41:40,257 INFO L93 Difference]: Finished difference Result 288 states and 432 transitions. [2024-12-02 12:41:40,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 12:41:40,258 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-12-02 12:41:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:41:40,260 INFO L225 Difference]: With dead ends: 288 [2024-12-02 12:41:40,260 INFO L226 Difference]: Without dead ends: 186 [2024-12-02 12:41:40,260 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-12-02 12:41:40,261 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 76 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-12-02 12:41:40,261 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.2s Time] [2024-12-02 12:41:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-12-02 12:41:40,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 151. [2024-12-02 12:41:40,292 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-12-02 12:41:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 229 transitions. [2024-12-02 12:41:40,294 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 229 transitions. Word has length 119 [2024-12-02 12:41:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:41:40,294 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 229 transitions. [2024-12-02 12:41:40,295 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-12-02 12:41:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 229 transitions. [2024-12-02 12:41:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-02 12:41:40,296 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:41:40,296 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-12-02 12:41:40,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 12:41:40,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:41:40,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:41:40,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2032696591, now seen corresponding path program 1 times [2024-12-02 12:41:40,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:41:40,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803923261] [2024-12-02 12:41:40,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:41:40,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:41:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:41:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 12:41:52,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:41:52,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803923261] [2024-12-02 12:41:52,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803923261] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:41:52,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:41:52,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 12:41:52,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73548375] [2024-12-02 12:41:52,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:41:52,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:41:52,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:41:52,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:41:52,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:41:52,107 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-12-02 12:41:57,170 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-12-02 12:41:59,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-02 12:42:08,136 WARN L286 SmtUtils]: Spent 5.62s 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-12-02 12:42:13,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-02 12:42:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:42:14,729 INFO L93 Difference]: Finished difference Result 219 states and 313 transitions. [2024-12-02 12:42:14,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 12:42:14,730 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-12-02 12:42:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:42:14,732 INFO L225 Difference]: With dead ends: 219 [2024-12-02 12:42:14,732 INFO L226 Difference]: Without dead ends: 217 [2024-12-02 12:42:14,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-12-02 12:42:14,734 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 87 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-12-02 12:42:14,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 536 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 335 Invalid, 1 Unknown, 0 Unchecked, 13.8s Time] [2024-12-02 12:42:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-12-02 12:42:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 152. [2024-12-02 12:42:14,755 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-12-02 12:42:14,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2024-12-02 12:42:14,757 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 119 [2024-12-02 12:42:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:42:14,757 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2024-12-02 12:42:14,757 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-12-02 12:42:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2024-12-02 12:42:14,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-02 12:42:14,759 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:42:14,759 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-12-02 12:42:14,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 12:42:14,760 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:42:14,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:42:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1975438289, now seen corresponding path program 1 times [2024-12-02 12:42:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:42:14,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642863800] [2024-12-02 12:42:14,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:42:14,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:42:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:42:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 12:42:45,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:42:45,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642863800] [2024-12-02 12:42:45,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642863800] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:42:45,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:42:45,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-12-02 12:42:45,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573610925] [2024-12-02 12:42:45,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:42:45,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:42:45,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:42:45,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:42:45,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:42:45,692 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-12-02 12:42:55,254 WARN L286 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 145 DAG size of output: 120 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-02 12:43:00,240 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-12-02 12:43:03,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-02 12:43:15,413 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-12-02 12:43:16,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:43:16,018 INFO L93 Difference]: Finished difference Result 219 states and 313 transitions. [2024-12-02 12:43:16,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 12:43:16,019 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-12-02 12:43:16,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:43:16,020 INFO L225 Difference]: With dead ends: 219 [2024-12-02 12:43:16,020 INFO L226 Difference]: Without dead ends: 217 [2024-12-02 12:43:16,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2024-12-02 12:43:16,021 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 107 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 62 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2024-12-02 12:43:16,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 531 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 292 Invalid, 2 Unknown, 0 Unchecked, 15.5s Time] [2024-12-02 12:43:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-12-02 12:43:16,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 150. [2024-12-02 12:43:16,046 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-12-02 12:43:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2024-12-02 12:43:16,047 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 119 [2024-12-02 12:43:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:43:16,048 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2024-12-02 12:43:16,048 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-12-02 12:43:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2024-12-02 12:43:16,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-02 12:43:16,049 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:43:16,050 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-12-02 12:43:16,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 12:43:16,050 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:43:16,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:43:16,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1634763599, now seen corresponding path program 1 times [2024-12-02 12:43:16,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:43:16,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271885469] [2024-12-02 12:43:16,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:43:16,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:43:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:43:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-12-02 12:43:16,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:43:16,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271885469] [2024-12-02 12:43:16,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271885469] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:43:16,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679112096] [2024-12-02 12:43:16,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:43:16,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:43:16,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:43:16,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:43:16,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 12:43:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:43:16,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-12-02 12:43:16,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:43:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-12-02 12:43:16,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:43:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-12-02 12:43:17,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679112096] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 12:43:17,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 12:43:17,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2024-12-02 12:43:17,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703045690] [2024-12-02 12:43:17,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 12:43:17,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 12:43:17,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:43:17,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 12:43:17,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-12-02 12:43:17,639 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-12-02 12:43:18,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:43:18,783 INFO L93 Difference]: Finished difference Result 593 states and 865 transitions. [2024-12-02 12:43:18,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-12-02 12:43:18,784 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-12-02 12:43:18,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:43:18,786 INFO L225 Difference]: With dead ends: 593 [2024-12-02 12:43:18,786 INFO L226 Difference]: Without dead ends: 446 [2024-12-02 12:43:18,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2024-12-02 12:43:18,787 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 167 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2024-12-02 12:43:18,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 215 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-12-02 12:43:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-12-02 12:43:18,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 294. [2024-12-02 12:43:18,861 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-12-02 12:43:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 434 transitions. [2024-12-02 12:43:18,864 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 434 transitions. Word has length 119 [2024-12-02 12:43:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:43:18,864 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 434 transitions. [2024-12-02 12:43:18,864 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-12-02 12:43:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 434 transitions. [2024-12-02 12:43:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-02 12:43:18,865 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:43:18,866 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-12-02 12:43:18,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-12-02 12:43:19,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-12-02 12:43:19,066 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:43:19,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:43:19,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1795166832, now seen corresponding path program 1 times [2024-12-02 12:43:19,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:43:19,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537111928] [2024-12-02 12:43:19,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:43:19,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:43:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-02 12:43:19,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501431215] [2024-12-02 12:43:19,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:43:19,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:43:19,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:43:19,115 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:43:19,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 12:43:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:43:19,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-12-02 12:43:19,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:43:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-12-02 12:43:20,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:43:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-12-02 12:43:24,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:43:24,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537111928] [2024-12-02 12:43:24,524 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-12-02 12:43:24,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501431215] [2024-12-02 12:43:24,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501431215] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 12:43:24,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 12:43:24,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2024-12-02 12:43:24,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048226596] [2024-12-02 12:43:24,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:43:24,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 12:43:24,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:43:24,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 12:43:24,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-12-02 12:43:24,526 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-12-02 12:43:28,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:43:28,936 INFO L93 Difference]: Finished difference Result 550 states and 800 transitions. [2024-12-02 12:43:28,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:43:28,936 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-12-02 12:43:28,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:43:28,939 INFO L225 Difference]: With dead ends: 550 [2024-12-02 12:43:28,939 INFO L226 Difference]: Without dead ends: 299 [2024-12-02 12:43:28,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2024-12-02 12:43:28,941 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 81 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-12-02 12:43:28,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 357 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-12-02 12:43:28,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-12-02 12:43:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 251. [2024-12-02 12:43:28,984 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-12-02 12:43:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 367 transitions. [2024-12-02 12:43:28,986 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 367 transitions. Word has length 120 [2024-12-02 12:43:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:43:28,986 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 367 transitions. [2024-12-02 12:43:28,986 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-12-02 12:43:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 367 transitions. [2024-12-02 12:43:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-02 12:43:28,988 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:43:28,988 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-12-02 12:43:28,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 12:43:29,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:43:29,189 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:43:29,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:43:29,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1254402368, now seen corresponding path program 1 times [2024-12-02 12:43:29,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:43:29,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336045755] [2024-12-02 12:43:29,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:43:29,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:43:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:43:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-12-02 12:43:37,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:43:37,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336045755] [2024-12-02 12:43:37,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336045755] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:43:37,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:43:37,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 12:43:37,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302546440] [2024-12-02 12:43:37,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:43:37,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 12:43:37,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:43:37,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 12:43:37,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-12-02 12:43:37,644 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-12-02 12:43:41,968 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-12-02 12:43:43,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-02 12:43:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:43:47,640 INFO L93 Difference]: Finished difference Result 314 states and 449 transitions. [2024-12-02 12:43:47,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 12:43:47,641 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-12-02 12:43:47,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:43:47,644 INFO L225 Difference]: With dead ends: 314 [2024-12-02 12:43:47,644 INFO L226 Difference]: Without dead ends: 312 [2024-12-02 12:43:47,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-12-02 12:43:47,644 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 47 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-12-02 12:43:47,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 345 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2024-12-02 12:43:47,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-12-02 12:43:47,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 255. [2024-12-02 12:43:47,693 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-12-02 12:43:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 374 transitions. [2024-12-02 12:43:47,695 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 374 transitions. Word has length 233 [2024-12-02 12:43:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:43:47,695 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 374 transitions. [2024-12-02 12:43:47,695 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-12-02 12:43:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 374 transitions. [2024-12-02 12:43:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-02 12:43:47,698 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:43:47,698 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-12-02 12:43:47,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 12:43:47,698 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:43:47,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:43:47,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1197144066, now seen corresponding path program 1 times [2024-12-02 12:43:47,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:43:47,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004316368] [2024-12-02 12:43:47,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:43:47,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:43:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:44:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-12-02 12:44:08,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:44:08,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004316368] [2024-12-02 12:44:08,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004316368] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:44:08,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:44:08,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 12:44:08,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791621986] [2024-12-02 12:44:08,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:44:08,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 12:44:08,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:44:08,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 12:44:08,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-12-02 12:44:08,994 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-12-02 12:44:11,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-02 12:44:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:44:17,108 INFO L93 Difference]: Finished difference Result 300 states and 432 transitions. [2024-12-02 12:44:17,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 12:44:17,109 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-12-02 12:44:17,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:44:17,110 INFO L225 Difference]: With dead ends: 300 [2024-12-02 12:44:17,110 INFO L226 Difference]: Without dead ends: 298 [2024-12-02 12:44:17,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-12-02 12:44:17,111 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 31 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s 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, 4.9s IncrementalHoareTripleChecker+Time [2024-12-02 12:44:17,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 330 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-12-02 12:44:17,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-12-02 12:44:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 151. [2024-12-02 12:44:17,138 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-12-02 12:44:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2024-12-02 12:44:17,139 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 233 [2024-12-02 12:44:17,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:44:17,139 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2024-12-02 12:44:17,139 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-12-02 12:44:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2024-12-02 12:44:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-02 12:44:17,141 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:44:17,141 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-12-02 12:44:17,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 12:44:17,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:44:17,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:44:17,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2000995963, now seen corresponding path program 1 times [2024-12-02 12:44:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:44:17,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080085496] [2024-12-02 12:44:17,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:44:17,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:44:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:44:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-12-02 12:44:35,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:44:35,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080085496] [2024-12-02 12:44:35,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080085496] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:44:35,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:44:35,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 12:44:35,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864431584] [2024-12-02 12:44:35,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:44:35,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 12:44:35,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:44:35,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 12:44:35,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-12-02 12:44:35,507 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-12-02 12:44:44,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-02 12:44:53,621 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-12-02 12:44:57,630 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-12-02 12:45:01,634 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-12-02 12:45:07,030 WARN L286 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-02 12:45:12,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-02 12:45:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:45:12,672 INFO L93 Difference]: Finished difference Result 170 states and 243 transitions. [2024-12-02 12:45:12,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 12:45:12,673 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-12-02 12:45:12,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:45:12,674 INFO L225 Difference]: With dead ends: 170 [2024-12-02 12:45:12,674 INFO L226 Difference]: Without dead ends: 168 [2024-12-02 12:45:12,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-12-02 12:45:12,675 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 24 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2024-12-02 12:45:12,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 453 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 4 Unknown, 0 Unchecked, 21.1s Time] [2024-12-02 12:45:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-12-02 12:45:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2024-12-02 12:45:12,700 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-12-02 12:45:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2024-12-02 12:45:12,701 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 234 [2024-12-02 12:45:12,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:45:12,701 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2024-12-02 12:45:12,701 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-12-02 12:45:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2024-12-02 12:45:12,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-02 12:45:12,702 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:45:12,703 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-12-02 12:45:12,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 12:45:12,703 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:45:12,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:45:12,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1943737661, now seen corresponding path program 1 times [2024-12-02 12:45:12,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:45:12,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325903452] [2024-12-02 12:45:12,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:45:12,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:45:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:45:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-12-02 12:45:25,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:45:25,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325903452] [2024-12-02 12:45:25,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325903452] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 12:45:25,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349135402] [2024-12-02 12:45:25,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:45:25,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 12:45:25,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 12:45:25,728 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 12:45:25,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 12:45:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:45:26,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-12-02 12:45:26,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 12:46:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 1161 proven. 138 refuted. 0 times theorem prover too weak. 1551 trivial. 0 not checked. [2024-12-02 12:46:04,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 12:47:44,191 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-12-02 12:49:20,566 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-12-02 12:49:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-12-02 12:49:55,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349135402] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 12:49:55,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-02 12:49:55,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 12] total 25 [2024-12-02 12:49:55,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964237093] [2024-12-02 12:49:55,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:49:55,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 12:49:55,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:49:55,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 12:49:55,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=406, Unknown=20, NotChecked=86, Total=600 [2024-12-02 12:49:55,225 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-12-02 12:49:59,845 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-12-02 12:50:03,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-12-02 12:50:07,241 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-12-02 12:50:11,247 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-12-02 12:50:15,256 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-12-02 12:50:19,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-12-02 12:50:23,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-12-02 12:50:27,042 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-12-02 12:50:31,046 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-12-02 12:50:35,052 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-12-02 12:50:39,062 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-12-02 12:50:43,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-12-02 12:50:48,841 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-12-02 12:50:53,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-12-02 12:50:58,025 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-12-02 12:51:02,032 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-12-02 12:51:06,038 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-12-02 12:51:10,236 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-12-02 12:51:14,245 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-12-02 12:51:19,124 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-12-02 12:51:23,321 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-12-02 12:51:27,730 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-12-02 12:51:31,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 [1] [2024-12-02 12:51:35,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-12-02 12:51:39,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-12-02 12:51:44,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-12-02 12:51:48,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-12-02 12:51:51,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-12-02 12:51:55,674 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-12-02 12:51:59,937 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-12-02 12:52:04,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-12-02 12:52:08,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-12-02 12:52:12,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-12-02 12:52:13,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-12-02 12:52:18,092 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-12-02 12:52:22,216 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-12-02 12:52:26,560 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-12-02 12:52:30,572 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-12-02 12:52:34,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-12-02 12:52:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:52:34,634 INFO L93 Difference]: Finished difference Result 173 states and 246 transitions. [2024-12-02 12:52:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 12:52:34,653 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-12-02 12:52:34,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:52:34,654 INFO L225 Difference]: With dead ends: 173 [2024-12-02 12:52:34,654 INFO L226 Difference]: Without dead ends: 171 [2024-12-02 12:52:34,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 458 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 112.4s TimeCoverageRelationStatistics Valid=90, Invalid=407, Unknown=21, NotChecked=132, Total=650 [2024-12-02 12:52:34,655 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 24 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 153.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 155.0s IncrementalHoareTripleChecker+Time [2024-12-02 12:52:34,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 506 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 34 Unknown, 112 Unchecked, 155.0s Time] [2024-12-02 12:52:34,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-12-02 12:52:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 151. [2024-12-02 12:52:34,698 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-12-02 12:52:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2024-12-02 12:52:34,699 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 234 [2024-12-02 12:52:34,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:52:34,699 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2024-12-02 12:52:34,699 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-12-02 12:52:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2024-12-02 12:52:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-02 12:52:34,701 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:52:34,701 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-12-02 12:52:34,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-12-02 12:52:34,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8be92733-3ff1-4e6d-948a-309b11f5c03a/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-12-02 12:52:34,901 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:52:34,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:52:34,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1945584703, now seen corresponding path program 1 times [2024-12-02 12:52:34,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:52:34,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203923870] [2024-12-02 12:52:34,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:52:34,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:52:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:53:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-12-02 12:53:03,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:53:03,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203923870] [2024-12-02 12:53:03,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203923870] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:53:03,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:53:03,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 12:53:03,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325240196] [2024-12-02 12:53:03,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:53:03,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 12:53:03,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:53:03,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 12:53:03,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-12-02 12:53:03,442 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-12-02 12:53:14,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-02 12:53:18,459 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-12-02 12:53:22,471 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-12-02 12:53:26,477 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-12-02 12:53:32,656 WARN L286 SmtUtils]: Spent 6.05s 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-12-02 12:53:41,562 WARN L286 SmtUtils]: Spent 8.78s 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-12-02 12:53:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:53:42,018 INFO L93 Difference]: Finished difference Result 171 states and 244 transitions. [2024-12-02 12:53:42,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 12:53:42,020 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-12-02 12:53:42,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:53:42,021 INFO L225 Difference]: With dead ends: 171 [2024-12-02 12:53:42,021 INFO L226 Difference]: Without dead ends: 169 [2024-12-02 12:53:42,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-12-02 12:53:42,021 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 26 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2024-12-02 12:53:42,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 412 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 3 Unknown, 0 Unchecked, 15.2s Time] [2024-12-02 12:53:42,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-12-02 12:53:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2024-12-02 12:53:42,047 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-12-02 12:53:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2024-12-02 12:53:42,048 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 234 [2024-12-02 12:53:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:53:42,049 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2024-12-02 12:53:42,049 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-12-02 12:53:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2024-12-02 12:53:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-02 12:53:42,049 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:53:42,050 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-12-02 12:53:42,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 12:53:42,050 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:53:42,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:53:42,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1484624707, now seen corresponding path program 1 times [2024-12-02 12:53:42,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:53:42,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365292571] [2024-12-02 12:53:42,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:53:42,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:53:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:53:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-12-02 12:53:42,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:53:42,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365292571] [2024-12-02 12:53:42,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365292571] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:53:42,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:53:42,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 12:53:42,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747951107] [2024-12-02 12:53:42,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:53:42,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 12:53:42,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:53:42,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 12:53:42,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-12-02 12:53:42,889 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-12-02 12:53:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:53:44,730 INFO L93 Difference]: Finished difference Result 452 states and 634 transitions. [2024-12-02 12:53:44,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 12:53:44,730 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-12-02 12:53:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:53:44,732 INFO L225 Difference]: With dead ends: 452 [2024-12-02 12:53:44,732 INFO L226 Difference]: Without dead ends: 352 [2024-12-02 12:53:44,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-12-02 12:53:44,732 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 163 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-12-02 12:53:44,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 476 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-12-02 12:53:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-12-02 12:53:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 290. [2024-12-02 12:53:44,818 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-12-02 12:53:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 414 transitions. [2024-12-02 12:53:44,820 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 414 transitions. Word has length 234 [2024-12-02 12:53:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:53:44,820 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 414 transitions. [2024-12-02 12:53:44,820 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-12-02 12:53:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 414 transitions. [2024-12-02 12:53:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-02 12:53:44,821 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:53:44,822 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-12-02 12:53:44,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 12:53:44,822 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:53:44,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:53:44,822 INFO L85 PathProgramCache]: Analyzing trace with hash -565784191, now seen corresponding path program 1 times [2024-12-02 12:53:44,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:53:44,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818940508] [2024-12-02 12:53:44,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:53:44,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:53:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 12:54:13,088 WARN L286 SmtUtils]: Spent 7.43s 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-12-02 12:54:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2024-12-02 12:54:18,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 12:54:18,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818940508] [2024-12-02 12:54:18,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818940508] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 12:54:18,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 12:54:18,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-12-02 12:54:18,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590377665] [2024-12-02 12:54:18,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 12:54:18,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 12:54:18,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 12:54:18,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 12:54:18,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-12-02 12:54:18,177 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-12-02 12:54:22,901 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-12-02 12:54:27,235 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-12-02 12:54:31,243 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-12-02 12:54:32,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-02 12:54:36,340 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod c_~var_1_13~0 256) 0)) (.cse1 (mod c_~var_1_12~0 256))) (let ((.cse10 (mod c_~var_1_6~0 65536)) (.cse9 (div c_~var_1_6~0 65536)) (.cse11 (mod c_~last_1_var_1_6~0 65536)) (.cse12 (div c_~var_1_4~0 65536)) (.cse8 (= .cse1 1)) (.cse7 (= (mod c_~var_1_14~0 256) 0)) (.cse6 (= (mod c_~var_1_16~0 256) 0)) (.cse5 (= (mod c_~var_1_15~0 256) 0)) (.cse2 (mod c_~var_1_17~0 256)) (.cse4 (not .cse0))) (and (<= (div c_~var_1_1~0 4294967296) 0) (= (mod c_~var_1_1~0 4294967296) 128) (or (let ((.cse3 (= .cse1 0))) (and (or (and .cse0 (= .cse1 .cse2)) .cse3) (or (and (or .cse4 (= .cse2 0)) (or .cse0 (and .cse5 .cse6 .cse7))) (not .cse3)))) .cse8) (<= (div c_~var_1_11~0 65536) .cse9) (= .cse10 (mod c_~var_1_11~0 65536)) (or (= .cse10 c_~var_1_18~0) (< (mod (+ (* c_~var_1_6~0 c_~var_1_6~0) (* c_~var_1_6~0 c_~var_1_7~0) (* c_~var_1_6~0 .cse9 4294836224) (* 4294901760 .cse9 c_~var_1_7~0)) 4294967296) 129)) (<= 1 |c_ULTIMATE.start_property_#res#1|) (not (= c_~last_1_var_1_18~0 .cse11)) (not (= 128 (mod (+ c_~var_1_4~0 (* 4294901760 .cse12) (* c_~var_1_1~0 4294967295)) 4294967296))) (let ((.cse16 (mod c_~last_1_var_1_18~0 4294967296)) (.cse15 (+ c_~var_1_4~0 (* .cse12 (- 65536)))) (.cse13 (mod c_~last_1_var_1_1~0 4294967296))) (or (and (<= (+ .cse11 1) .cse13) (let ((.cse14 (+ (* (div c_~last_1_var_1_1~0 4294967296) (- 4294967296)) c_~last_1_var_1_1~0))) (<= (+ (* (div .cse14 .cse15 4294967296) 4294967296) .cse16 1) (div .cse14 .cse15)))) (and (let ((.cse17 (let ((.cse18 (* (div c_~last_1_var_1_6~0 65536) (- 65536)))) (+ (* (- 4294967296) (div (+ .cse18 c_~last_1_var_1_6~0) 4294967296)) .cse18 c_~last_1_var_1_6~0)))) (<= (+ .cse16 (* (div .cse17 .cse15 4294967296) 4294967296) 1) (div .cse17 .cse15))) (<= .cse13 .cse11)))) (or (not .cse8) (and (or .cse0 (not .cse7) (not .cse6) (not .cse5)) (or (= .cse2 1) .cse4)))))) is different from false [2024-12-02 12:54:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 12:54:37,322 INFO L93 Difference]: Finished difference Result 343 states and 483 transitions. [2024-12-02 12:54:37,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 12:54:37,323 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-12-02 12:54:37,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 12:54:37,326 INFO L225 Difference]: With dead ends: 343 [2024-12-02 12:54:37,326 INFO L226 Difference]: Without dead ends: 341 [2024-12-02 12:54:37,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2024-12-02 12:54:37,327 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 25 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2024-12-02 12:54:37,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 483 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 3 Unknown, 8 Unchecked, 15.0s Time] [2024-12-02 12:54:37,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-12-02 12:54:37,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 291. [2024-12-02 12:54:37,390 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-12-02 12:54:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 416 transitions. [2024-12-02 12:54:37,392 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 416 transitions. Word has length 234 [2024-12-02 12:54:37,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 12:54:37,392 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 416 transitions. [2024-12-02 12:54:37,392 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-12-02 12:54:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 416 transitions. [2024-12-02 12:54:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-02 12:54:37,393 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 12:54:37,393 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-12-02 12:54:37,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 12:54:37,394 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 12:54:37,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 12:54:37,394 INFO L85 PathProgramCache]: Analyzing trace with hash -508525889, now seen corresponding path program 1 times [2024-12-02 12:54:37,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 12:54:37,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34620093] [2024-12-02 12:54:37,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 12:54:37,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 12:54:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat